Disjunctive Cuts for Nonconvex MINLP
From MaRDI portal
Publication:2897296
DOI10.1007/978-1-4614-1927-3_5zbMath1242.90118MaRDI QIDQ2897296
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_5
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
Related Items
How to convexify the intersection of a second order cone and a nonconvex quadratic, Global optimization of generalized semi-infinite programs using disjunctive programming, Two-term disjunctions on the second-order cone, The value of cooperation in interregional transmission planning: a noncooperative equilibrium model approach, Exact and approximation algorithms for a soft rectangle packing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Solving planning and design problems in the process industry using mixed integer and global optimization
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- Bounds for the quadratic assignment problem using the bundle method
- Chvátal closures for mixed integer programming problems
- Reformulation in mathematical programming: An application to quantum chemistry
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Convex envelopes of monomials of odd degree
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- On the separation of split cuts and related inequalities
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Split closure and intersection cuts
- 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
- Branching rules revisited
- BARON: A general purpose global optimization software package
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Optimizing over the split closure
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Cuts for mixed 0-1 conic programming
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
- Experiments in mixed-integer linear programming
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Benchmarking optimization software with performance profiles.
