A review of different approaches to the facility layout problems
Here, an attempt is made to present a state-of-the-art review of papers on facility layout
problems. This paper aims to deal with the current and future trends of research on facility …
problems. This paper aims to deal with the current and future trends of research on facility …
Quadratic assignment problems
RE Burkard - European Journal of Operational Research, 1984 - Elsevier
This paper surveys quadratic assignment problems (QAP). At first several applications of this
problem class are described and mathematical formulations of QAPs are given. Then some …
problem class are described and mathematical formulations of QAPs are given. Then some …
[BOOK][B] Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial
optimization and neural computing | Guide books skip to main content ACM Digital Library …
optimization and neural computing | Guide books skip to main content ACM Digital Library …
[BOOK][B] Assignment problems: revised reprint
R Burkard, M Dell'Amico, S Martello - 2012 - SIAM
When SIAM asked us to prepare a new edition of this book after less than three years from
publication, we expected a light duty. Just the correction of some typos and imprecisions …
publication, we expected a light duty. Just the correction of some typos and imprecisions …
Improving the scalability of data center networks with traffic-aware virtual machine placement
The scalability of modern data centers has become a practical concern and has attracted
significant attention in recent years. In contrast to existing solutions that require changes in …
significant attention in recent years. In contrast to existing solutions that require changes in …
Robust taboo search for the quadratic assignment problem
É Taillard - Parallel computing, 1991 - Elsevier
An adaptation of taboo search to the quadratic assignment problem is discussed in this
paper. This adaptation is efficient and robust, requiring less complexity and fewer …
paper. This adaptation is efficient and robust, requiring less complexity and fewer …
A survey for the quadratic assignment problem
EM Loiola, NMM De Abreu… - European journal of …, 2007 - Elsevier
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard
class, models many real-life problems in several areas such as facilities location, parallel …
class, models many real-life problems in several areas such as facilities location, parallel …
QAPLIB–a quadratic assignment problem library
A collection of electronically available data instances for the QuadraticAssignment Problem
is described. For each instance, we provide detailedinformation, indicating whether or not …
is described. For each instance, we provide detailedinformation, indicating whether or not …
Ant colonies for the quadratic assignment problem
This paper presents HAS–QAP, a hybrid ant colony system coupled with a local search,
applied to the quadratic assignment problem. HAS–QAP uses pheromone trail information to …
applied to the quadratic assignment problem. HAS–QAP uses pheromone trail information to …
Chemical-reaction-inspired metaheuristic for optimization
We encounter optimization problems in our daily lives and in various research domains.
Some of them are so hard that we can, at best, approximate the best solutions with (meta-) …
Some of them are so hard that we can, at best, approximate the best solutions with (meta-) …