Disjunctive cuts in mixed-integer conic optimization
From MaRDI portal
Publication:6038657
DOI10.1007/s10107-022-01844-1zbMath1518.90053arXiv1912.03166MaRDI QIDQ6038657
Juan Pablo Vielma, Andrea Lodi, Mathieu Tanneau
Publication date: 2 May 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.03166
Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cites Work
- Unnamed Item
- Unnamed Item
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- On sublinear inequalities for mixed integer conic programs
- Reflections on generating (disjunctive) cuts
- On the separation of disjunctive cuts
- Lifting for conic mixed-integer programming
- Lift-and-project for mixed 0-1 programming: recent progress
- Reformulating the disjunctive cut generating linear program
- Conic mixed-integer rounding cuts
- Two-term disjunctions on the second-order cone
- An algorithmic framework for convex mixed integer nonlinear programs
- Strengthening cuts for mixed integer programs
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Disjunctive cuts for cross-sections of the second-order cone
- Polyhedral approximation in mixed-integer convex optimization
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- A disjunctive cut strengthening technique for convex MINLP
- Outer approximation with conic certificates for mixed-integer convex problems
- The split closure of a strictly convex body
- ``Facet separation with one linear program
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On optimizing over lift-and-project closures
- Cuts for mixed 0-1 conic programming
- Lectures on Modern Convex Optimization
- On Minimal Valid Inequalities for Mixed Integer Conic Programs
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- Extended Formulations in Mixed-Integer Convex Programming
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- Convex Analysis
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
