Best reduction of the quadratic semi-assignment problem
- 13 February 2001
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 109 (3) , 197-213
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Polyhedral Methods for the QAP2000
- A lower bound for a constrained quadratic 0–1 minimization problemDiscrete Applied Mathematics, 1997
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear ProgrammingOperations Research, 1995
- Improved linear programming-based lower bounds for the quadratic assignment problem1994
- An efficient algorithm for a task allocation problemJournal of the ACM, 1992
- Unconstrained 0–1 optimization and Lagrangean relaxationDiscrete Applied Mathematics, 1990
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming ProblemsManagement Science, 1986
- Roof duality, complementation and persistency in quadratic 0–1 optimizationMathematical Programming, 1984
- On the quadratic assignment problemDiscrete Applied Mathematics, 1983
- A Selection Problem of Shared Fixed Costs and Network FlowsManagement Science, 1970