Frontiers

Partitioning QUBO with two-way one-hot conditions on traveling salesman problems for city distributions with multiple clusters

We introduce a method for solving a quadratic unconstrained binary optimization (QUBO) with the two-way one-hot constraints by dividing the QUBO into parts and solving it with an Ising machine. The ...
IEEE

A Multi-Agent Based Algorithm for Quadratic Assignment Problem

Abstract: The quadratic assignment problem (QAP) is a classical NP-hard combinatorial optimization problem. It has many real life applications such as airport gate assignment, and facility location ...
GitHub

quadratic-assignment-problem

Add a description, image, and links to the quadratic-assignment-problem topic page so that developers can more easily learn about it.
Scientific Research Publishing

E. Cela, “The Quadratic Assignment Problem, Theory and Algorithms,” Kluwer Academic Publishers, Dordrecht, 1998.

ABSTRACT: The single row facility layout problem (SRFLP) is an important combinatorial optimization problem where a given set of facilities have to be arranged in a single row to minimize the weighted ...
Scientific Research Publishing

V. Maniezzo, M. Dorigo, and A. Colorni, “The ant sys-tem applied to quadratic assignment problem,” Technical Report IRIDIA94-28, University de Bruxelles, Belgium, 1994.

ABSTRACT: In order to solve the premature convergence problem of the basic Ant Colony Optimization algorithm, a promising modification with changing index was proposed. The main idea of the ...