On the separation of split inequalities for non-convex quadratic integer programming
From MaRDI portal
Publication:2339844
DOI10.1016/J.DISOPT.2014.08.002zbMATH Open1308.90120OpenAlexW2075761281MaRDI QIDQ2339844FDOQ2339844
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
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Extending the QCR method to general mixed-integer programs
- On a positive semidefinite relaxation of the cut polytope
- Linear Programming Relaxations of Quadratically Constrained Quadratic 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
- The cut polytope and the Boolean quadric polytope
- Integer Quadratic Quasi-polyhedra
- An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
- Unbounded convex sets for non-convex mixed-integer quadratic programming
Cited In (5)
- Valid inequalities for quadratic optimisation with domain constraints
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Quadratic programs with hollows
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Special cases of the quadratic shortest path problem
Uses Software
This page was built for publication: On the separation of split inequalities for non-convex quadratic integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339844)
