Breakout local search for the quadratic assignment problem
- 1 January 2013
- journal article
- research article
- Published by Elsevier BV in Applied Mathematics and Computation
- Vol. 219 (9), 4800-4815
- https://doi.org/10.1016/j.amc.2012.10.106
Abstract
No abstract availableFunding Information
- Conseil Régional des Pays de la Loire
This publication has 29 references indexed in Scilit:
- Breakout Local Search for the Max-CutproblemEngineering Applications of Artificial Intelligence, 2013
- Breakout Local Search for maximum clique problemsComputers & Operations Research, 2013
- A Study of Breakout Local Search for the Minimum Sum Coloring ProblemLecture Notes in Computer Science, 2012
- A Multilevel Memetic Approach for Improving Graph k-PartitionsIEEE Transactions on Evolutionary Computation, 2011
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problemComputers & Operations Research, 2008
- A branch-and-cut algorithm for quadratic assignment problems based on linearizationsComputers & Operations Research, 2007
- The quadratic assignment problem in the context of the printed circuit board assembly processComputers & Operations Research, 2007
- A New Genetic Algorithm for the Quadratic Assignment ProblemINFORMS Journal on Computing, 2003
- A greedy genetic algorithm for the quadratic assignment problemComputers & Operations Research, 2000
- The Reactive Tabu SearchINFORMS Journal on Computing, 1994