Box-inequalities for quadratic assignment polytopes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1173721
- A study of the quadratic semi-assignment polytope
- scientific article; zbMATH DE number 4143776
- A family of inequalities for the generalized assignment polytope
- Tighter bounds for the discrepancy of boxes and polytopes
- A polyhedral study of nonconvex quadratic programs with box constraints
- Polyhedral combinatorics of quadratic assignment problems with less objects than locations
- A new polynomially solvable class of quadratic optimization problems with box constraints
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
Cited in
(11)- A study of the quadratic semi-assignment polytope
- The QAP-polytope and the graph isomorphism problem
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- On the SQAP-polytope
- scientific article; zbMATH DE number 1894379 (Why is no real title available?)
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- The Boolean quadric polytope
- Un Algorithme De Génération De Coupes Pour Le Problème De L’Affectation Quadratique
- A survey for the quadratic assignment problem
- Effective formulation reductions for the quadratic assignment problem
This page was built for publication: Box-inequalities for quadratic assignment polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955568)