A computational study on the quadratic knapsack problem with multiple constraints
From MaRDI portal
Publication:1761936
DOI10.1016/j.cor.2010.12.017zbMath1251.90291MaRDI QIDQ1761936
Fred Glover, Haibo Wang, Gary A. Kochenberger
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.017
linearization; knapsack problem; 0-1 quadratic programming; branch-and-cut; \texttt{CPLEX}; mixed integer quadratic program
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C20: Quadratic programming
Related Items
An ejection chain approach for the quadratic multiple knapsack problem, Generalized quadratic multiple knapsack problem and two solution approaches, Simple solution methods for separable mixed linear and quadratic knapsack problem, Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners, Planning personnel retraining: column generation heuristics, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Theoretical and computational study of several linearisation techniques for binary quadratic problems, A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments, Iterated responsive threshold search for the quadratic multiple knapsack problem, The bipartite Boolean quadric polytope
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- The quadratic knapsack problem -- a survey
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A unified modeling and solution framework for combinatorial optimization problems
- Linear forms of nonlinear expressions: new insights on old ideas
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
- An Improved MIP Formulation for Products of Discrete and Continuous Variables
- Quadratic knapsack problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Exact Solution of the Quadratic Knapsack Problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
