Backbone analysis and algorithm design for the quadratic assignment problem
From MaRDI portal
Publication:954381
Recommendations
- Backbone analysis and applications in heuristic algorithm design
- Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem
- scientific article; zbMATH DE number 2242691
- A note on backbones in optimization and approximation
- Evolutionary Computation in Combinatorial Optimization
Cites work
- A deterministic annnealing algorithm for a combinatorial optimization problem using replicator equations
- A new genetic algorithm for the quadratic assignment problem
- Ant colonies for the quadratic assignment problem
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- Determining computational complexity from characteristic ``phase transitions
- Doubly constrained network for combinatorial optimization
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1930743 (Why is no real title available?)
- scientific article; zbMATH DE number 2242691 (Why is no real title available?)
- scientific article; zbMATH DE number 2243360 (Why is no real title available?)
- Landscapes, operators and heuristic search
- Multi colony ant algorithms
- P-Complete Approximation Problems
- QAPLIB-A quadratic assignment problem library
- Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems
- The extended concentric tabu for the quadratic assignment problem
Cited in
(3)
This page was built for publication: Backbone analysis and algorithm design for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954381)