On the separation of split inequalities for non-convex quadratic integer programming
From MaRDI portal
Publication:2339844
DOI10.1016/j.disopt.2014.08.002zbMath1308.90120OpenAlexW2075761281MaRDI QIDQ2339844
Emiliano Traversi, Christoph Buchheim
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.08.002
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)
Related Items
Quadratic programs with hollows, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Valid inequalities for quadratic optimisation with domain constraints, Special cases of the quadratic shortest path problem, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
Uses Software
Cites Work
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Extending the QCR method to general mixed-integer programs
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- The cut polytope and the Boolean quadric polytope
- On a positive semidefinite relaxation of the cut polytope
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- Integer Quadratic Quasi-polyhedra
- An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
