Backbone analysis and algorithm design for the quadratic assignment problem

DOI10.1007/s11432-008-0042-0zbMath1181.90200OpenAlexW1971309415MaRDI QIDQ954381

He Jiang, Xianchao Zhang, Guo-Liang Chen, Ming-Chu Li

Publication date: 10 November 2008

Published in: Science in China. Series F (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11432-008-0042-0

zbMATH Keywords

quadratic assignment problemNP-hardmeta-heuristicbackbone analysisbiased instance

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Uses Software

• QAPLIB
• BG-WalkSAT
• Tabu search
• FANT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• QAPLIB-A quadratic assignment problem library
• Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
• Landscapes, operators and heuristic search
• Multi colony ant algorithms
• The extended concentric tabu for the quadratic assignment problem
• A New Genetic Algorithm for the Quadratic Assignment Problem
• Ant colonies for the quadratic assignment problem
• P-Complete Approximation Problems
• Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems
• Determining computational complexity from characteristic ‘phase transitions’
• A deterministic annnealing algorithm for a combinatorial optimization problem using replicator equations
• Doubly constrained network for combinatorial optimization

This page was built for publication: Backbone analysis and algorithm design for the quadratic assignment problem