The quadratic assignment problem (QAP) has considered one of the most significant
combinatorial optimization problems due to its variant and significant applications in real life …

Abstract In the Quadratic Assignment Problem (QAP), facilities are assigned to sites in order
to minimize interactions between pairs of facilities. Although easy to define, it is among the …

Boltzmann Machines are recurrent neural networks that have been used extensively in
combinatorial optimization due to their simplicity and ease of parallelization. This paper …

Local search metaheuristics are a recognized means of solving hard combinatorial
problems. Over the last couple of decades, significant advances have been made in terms of …

Assignment Problems are a class of NP-hard combinatorial optimization problems with a
wide range of real-world applications such as Vehicle Routing and FPGA Block Placement …

This paper presents a digital annealing engine capable of high-speed solving the Binary
Quadratic Programming Problem (BQP) with equality and inequality constraints. While many …

There is no question to the fact that electric vehicles (EVs) are the most viable solution to the
climate change that the planet has long been combating. Along the same line, it is a salient …

Abstract We propose PHYSH (Parallel HYbridization for Simple Heuristics), a framework to
ease the design and implementation of hybrid metaheuristics via cooperative parallelism …

Abstract The Quadratic Assignment Problem (QAP) is one of the most challenging
combinatorial optimization problems with many real-life applications. Currently, the best …

Many real-life applications can be formulated as Combinatorial Optimization Problems, the
solution of which is often challenging due to their intrinsic difficulty. At present, the most …