Gilmore-Lawler bound of quadratic assignment problem

DOI10.1007/s11464-008-0010-4zbMath1524.68149OpenAlexW1650177010MaRDI QIDQ6059115

Yong Xia

Publication date: 2 November 2023

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-008-0010-4

zbMATH Keywords

computational complexityNP-hardnessGilmore-Lawler bound

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• A survey for the quadratic assignment problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Generating quadratic assignment test problems with known optimal permutations
• Solving large-scale QAP problems in parallel with the serach library ZRAM
• Lower bounds for the quadratic assignment problem
• A new exact algorithm for the solution of quadratic assignment problems
• Solving large quadratic assignment problems in parallel
• The quadratic assignment problem. Theory and algorithms
• Recent advances in the solution of quadratic assignment problems
• Nonlinear assignment problems. Algorithms and applications
• The Quadratic Assignment Problem
• Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
• Assignment Problems and the Location of Economic Activities
• A new linearization method for quadratic assignment problems
• P-Complete Approximation Problems
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gilmore-Lawler bound of quadratic assignment problem