A computational study on the quadratic knapsack problem with multiple constraints
Authors:
- Haibo WangHWHaibo Wang
- Gary KochenbergerGKGary Kochenberger
- Fred GloverFGFred Glover
- 1 January 2012
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 39 (1) , 3-11
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Improved compact linearizations for the unconstrained quadratic 0–1 minimization problemDiscrete Applied Mathematics, 2009
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR methodDiscrete Applied Mathematics, 2009
- Solution of Large Quadratic Knapsack Problems Through Aggressive ReductionINFORMS Journal on Computing, 2007
- The quadratic knapsack problem—a surveyDiscrete Applied Mathematics, 2007
- An exact method based on Lagrangian decomposition for the 0–1 quadratic knapsack problemEuropean Journal of Operational Research, 2004
- A unified modeling and solution framework for combinatorial optimization problemsOR Spectrum, 2004
- Exact Solution of the Quadratic Knapsack ProblemINFORMS Journal on Computing, 1999
- Linear programming for the 0–1 quadratic knapsack problemEuropean Journal of Operational Research, 1996
- Lagrangean methods for the 0–1 Quadratic Knapsack ProblemEuropean Journal of Operational Research, 1996
- Cones of Matrices and Set-Functions and 0–1 OptimizationSIAM Journal on Optimization, 1991