Disjunctive Cuts for Nonconvex MINLP
From MaRDI portal
Publication:2897296
DOI10.1007/978-1-4614-1927-3_5zbMATH Open1242.90118OpenAlexW138692475MaRDI QIDQ2897296FDOQ2897296
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
Recommendations
- A disjunctive cut strengthening technique for convex MINLP
- Disjunctive cuts for mixed integer nonlinear programming problems
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Handling separable non-convexities using disjunctive cuts
- Concavity cuts for disjoint bilinear programming
- Disjunctive cuts in mixed-integer conic optimization
- A convex-analysis perspective on disjunctive cuts
- On disjunctive cuts for combinatorial optimization
- Disjunctive cuts for continuous linear bilevel programming
- Convex programming for disjunctive convex optimization
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11)
Cites Work
- BARON: A general purpose global optimization software package
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- The traveling salesman problem. A computational study.
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Branching rules revisited
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Title not available (Why is that?)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Title not available (Why is that?)
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- 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
- Title not available (Why is that?)
- Convex envelopes of monomials of odd degree
- Branching and bounds tighteningtechniques for non-convex MINLP
- Solving planning and design problems in the process industry using mixed integer and global optimization
- Split closure and intersection cuts
- Optimizing over the split closure
- Writing global optimization software
- Chvátal closures for mixed integer programming problems
- Reformulation in mathematical programming: An application to quantum chemistry
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Cuts for mixed 0-1 conic programming
- Experiments in mixed-integer linear programming
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- 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‐Prune algorithm for the Molecular Distance Geometry Problem
- 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
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Bounds for the quadratic assignment problem using the bundle method
- Title not available (Why is that?)
- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (13)
- On the facet defining inequalities of the mixed-integer bilinear covering set
- A convex-analysis perspective on disjunctive cuts
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- A general branch-and-bound framework for continuous global multiobjective optimization
- The value of cooperation in interregional transmission planning: a noncooperative equilibrium model approach
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Two-term disjunctions on the second-order cone
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Exact and approximation algorithms for a soft rectangle packing problem
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Disjunctive cuts for continuous linear bilevel programming
Uses Software
This page was built for publication: Disjunctive Cuts for Nonconvex MINLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897296)
