The QAP-polytope and the star transformation
From MaRDI portal
Publication:5939231
DOI10.1016/S0166-218X(00)00272-9zbMath0978.90071MaRDI QIDQ5939231
Publication date: 5 February 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
A survey for the quadratic assignment problem, Locating names on vertices of a transaction network, Selected topics on assignment problems, Effective formulation reductions for the quadratic assignment problem, A study of the quadratic semi-assignment polytope
Cites Work
- Unnamed Item
- Unnamed Item
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Location, scheduling, design and integer programming
- Lower bounds based on linear programming for the quadratic assignment problem
- The cut polytope and the Boolean quadric polytope
- The Quadratic Assignment Problem
- On the Assignment Polytope
- Assignment Problems and the Location of Economic Activities
- On the cut polytope
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem