Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering
From MaRDI portal
Publication:2168744
DOI10.1007/s10878-021-00840-zzbMath1498.90188OpenAlexW4206918891MaRDI QIDQ2168744
Lucas A. Waddell, Richard J. Forrester
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00840-z
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A simple recipe for concise mixed 0-1 linearizations
- Tightening concise linear reformulations of 0-1 cubic programs
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Quadratic knapsack problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Exact Solution of the Quadratic Knapsack Problem
- A Fast Parametric Maximum Flow Algorithm and Applications
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
This page was built for publication: Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering
