Sufficiency of cut-generating functions

DOI10.1007/s10107-014-0780-2zbMath1327.90132OpenAlexW2104956187MaRDI QIDQ494318

Sercan Yıldız, Cornuéjols, Gérard, Laurence A. Wolsey

Publication date: 31 August 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-014-0780-2

zbMATH Keywords

mixed integer programmingseparationintersection cutscorner polyhedron

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Related Items

Maximal Quadratic-Free Sets, On sublinear inequalities for mixed integer conic programs, The structure of the infinite models in integer programming, Outer-product-free sets for polynomial optimization and oracle-based cuts, 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, A geometric approach to cut-generating functions, Maximal quadratic-free sets

Cites Work

• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
• Equivalence between intersection cuts and the corner polyhedron
• On degenerate multi-row Gomory cuts
• Some polyhedra related to combinatorial problems
• Constrained Infinite Group Relaxations of MIPs
• Minimal Inequalities for an Infinite Relaxation of Integer Programs
• Characterization of facets for multiple right-hand choice linear programs
• Cut-Generating Functions
• Inequalities from Two Rows of a Simplex Tableau
• Convex Analysis
• Some continuous functions related to corner polyhedra