Constrained 0–1 quadratic programming: Basic approaches and extensions
Author:
- Alberto CapraraACAlberto Caprara
- 1 June 2008
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 187 (3) , 1494-1503
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- A Heuristic Method for the Set Covering ProblemOperations Research, 1999
- Exact Solution of the Quadratic Knapsack ProblemINFORMS Journal on Computing, 1999
- A Lagrangian-based heuristic for large-scale set covering problemsMathematical Programming, 1998
- Linear programming for the 0–1 quadratic knapsack problemEuropean Journal of Operational Research, 1996
- A reformulation scheme and new lower bounds for the QAP1994
- Improved linear programming-based lower bounds for the quadratic assignment problem1994
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- The cut polytope and the Boolean quadric polytopeDiscrete Mathematics, 1990
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming ProblemsManagement Science, 1986