Box-inequalities for quadratic assignment polytopes

DOI10.1007/s101070100251zbMath1064.90053OpenAlexW1497213067MaRDI QIDQ5955568

Michael Jünger, Volker Kaibel

Publication date: 2001

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100251

zbMATH Keywords

facet-defining inequalitiescutting planespolyhedral combinatoricsQuadratic assignment problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

The QAP-polytope and the graph isomorphism problem, The Boolean Quadric Polytope, A survey for the quadratic assignment problem, Unbounded convex sets for non-convex mixed-integer quadratic programming, An experimental study of variable depth search algorithms for the quadratic assignment problem, Effective formulation reductions for the quadratic assignment problem, A performance guarantee heuristic for electronic components placement problems including thermal effects, A study of the quadratic semi-assignment polytope