Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
From MaRDI portal
Publication:3503837
DOI10.1007/978-3-540-68891-4_2zbMath1143.90365OpenAlexW1588352969MaRDI QIDQ3503837
Jon Lee, Pierre Bonami, Anureet Saxena
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_2
Related Items
How to select a small set of diverse solutions to mixed integer programming problems, Disjunctive Cuts for Nonconvex MINLP, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Two-term disjunctions on the second-order cone, On the facet defining inequalities of the mixed-integer bilinear covering set, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, Extending the QCR method to general mixed-integer programs, Computing equilibria in discounted dynamic games, How to convexify the intersection of a second order cone and a nonconvex quadratic, Mixed integer programming with a class of nonlinear convex constraints, A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation, On Minimal Valid Inequalities for Mixed Integer Conic Programs, Convexification of bilinear forms through non-symmetric lifting
Uses Software
Cites Work
- Revival of the Gomory cuts in the 1990's
- Enhancing RLT relaxations via a new class of semidefinite cuts
- MIP reformulations of the probabilistic set covering problem
- An algorithmic framework for convex mixed integer nonlinear programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Relaxations for probabilistically constrained programs with discrete random variables
- Disjunctive programming: Properties of the convex hull of feasible points
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Optimizing over the First Chvàtal Closure
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Global Optimization and Constraint Satisfaction
