Cut-Generating Functions and S-Free Sets
From MaRDI portal
Publication:5252221
DOI10.1287/moor.2014.0670zbMath1317.52017OpenAlexW2136407239WikidataQ101129646 ScholiaQ101129646MaRDI QIDQ5252221
Cornuéjols, Gérard, Jérôme Malick, Michele Conforti, Claude Lemaréchal, Aris Daniilidis
Publication date: 29 May 2015
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2014.0670
Mixed integer programming (90C11) Convex functions and convex programs in convex geometry (52A41) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Related Items
Maximal Quadratic-Free Sets, On sublinear inequalities for mixed integer conic programs, Theoretical challenges towards cutting-plane selection, Intersection Disjunctions for Reverse Convex Sets, Multirow Intersection Cuts Based on the Infinity Norm, Towards a characterization of maximal quadratic-free sets, Outer-product-free sets for polynomial optimization and oracle-based cuts, Generating valid linear inequalities for nonlinear programs via sums of squares, Nonunique Lifting of Integer Variables in Minimal Inequalities, Can Cut-Generating Functions Be Good and Efficient?, Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case, Some cut-generating functions for second-order conic sets, Intersection cuts for convex mixed integer programs from translated cones, Centerpoints: A Link between Optimization and Convex Geometry, On the implementation and strengthening of intersection cuts for QCQPs, On Minimal Valid Inequalities for Mixed Integer Conic Programs, On the implementation and strengthening of intersection cuts for QCQPs, Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond, Cut-Generating Functions for Integer Variables, On Subadditive Duality for Conic Mixed-integer Programs, Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems, Maximal $S$-Free Convex Sets and the Helly Number, A geometric approach to cut-generating functions, On a generalization of the Chvátal-Gomory closure, Maximal quadratic-free sets, Light on the infinite group relaxation. I: Foundations and taxonomy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- A convex-analysis perspective on disjunctive cuts
- Some polyhedra related to combinatorial problems
- On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets
- Convex Sets and Minimal Sublinear Functions
- Constrained Infinite Group Relaxations of MIPs
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- On Maximal S-Free Convex Sets
- Minimal Valid Inequalities for Integer Constraints
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Characterization of facets for multiple right-hand choice linear programs
- Disjunctive Programming
- Inequalities from Two Rows of a Simplex Tableau
- Some continuous functions related to corner polyhedra
