Parametric convex quadratic relaxation of the quadratic knapsack problem
From MaRDI portal
Publication:2329476
DOI10.1016/j.ejor.2019.08.027zbMath1430.90452arXiv1901.06714OpenAlexW2969427933WikidataQ127373043 ScholiaQ127373043MaRDI QIDQ2329476
D. Lubke, Márcia H. C. Fampa, Fei Wang, Henry Wolkowicz
Publication date: 17 October 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.06714
parametric optimizationvalid inequalitiesquadratic knapsack problemquadratic binary programmingconvex quadratic programming relaxations
Related Items
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, A lifted-space dynamic programming algorithm for the quadratic knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Nonsmooth optimization via quasi-Newton methods
- Extending the QCR method to general mixed-integer programs
- Introduction to sensitivity and stability analysis in nonlinear programming
- Cover and pack inequalities for (mixed) integer programming
- 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
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- A semidefinite programming approach to the quadratic knapsack problem
- On global optimization with indefinite quadratics
- The Schur complement and its applications
- A new upper bound for the 0-1 quadratic knapsack problem
- Principal component analysis.
- DC programming: overview.
- A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
- Easily Computable Facets of the Knapsack Polytope
- Quadratic knapsack problems
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Facets of the Knapsack Polytope From Minimal Covers
- Exact Solution of the Quadratic Knapsack Problem
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- The Theory of Max-Min, with Applications
- Technical Note—The Continuity of the Perturbation Function of a Convex Program
- Lagrangian heuristics for the quadratic knapsack problem
