On the separation of split inequalities for non-convex quadratic integer programming

DOI10.1016/J.DISOPT.2014.08.002zbMATH Open1308.90120OpenAlexW2075761281MaRDI QIDQ2339844FDOQ2339844

Authors Christoph Buchheim, Emiliano Traversi 

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

zbMATH Keywords

split inequalitiesnon-convex quadratic integer programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• Gap inequalities for non-convex mixed-integer quadratic programs
• On the separation of split cuts and related inequalities
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
• On the relative strength of split, triangle and quadrilateral cuts
• On the relative strength of split, triangle and quadrilateral cuts

Cites work

• An effective branch-and-bound algorithm for convex quadratic integer programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• Disjunctive Programming
• Extending the QCR method to general mixed-integer programs
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• Integer quadratic quasi-polyhedra
• Linear programming relaxations of quadratically constrained quadratic programs
• On a positive semidefinite relaxation of the cut polytope
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• The cut polytope and the Boolean quadric polytope
• Unbounded convex sets for non-convex mixed-integer quadratic programming
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem

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

Describes a project that uses

Uses Software

• PORTA

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)