Cut-generating functions for integer variables

DOI10.1287/MOOR.2016.0781MaRDI QIDQ2833108zbMATH OpenOpenAlexFDO

Authors Sercan Yıldız, Gérard Cornuéjols

Publication date 16 November 2016

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/573056378d771b715015a0c9c9e1e1c05efa26c3

zbMATH Keywords

cutting planesinteger programming

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Cut-generating functions
• A geometric approach to cut-generating functions
• Sufficiency of cut-generating functions

Cites work

• A characterization of minimal valid inequalities for mixed integer programs
• A counterexample to a conjecture of Gomory and Johnson
• A geometric perspective on lifting
• A strong dual for conic mixed-integer programs
• Constrained infinite group relaxations of MIPs
• Cut-generating functions and S-free sets
• Equivalence between intersection cuts and the corner polyhedron
• Equivariant perturbation in Gomory and Johnson's infinite group problem. II: The unimodular two-dimensional case
• Functional Equations and Inequalities with Applications
• Inequalities from Two Rows of a Simplex Tableau
• Lifting Gomory cuts with bounded variables
• Minimal inequalities
• Minimal inequalities for mixed integer programs
• Minimal valid inequalities for integer constraints
• On minimal valid inequalities for mixed integer conic programs
• On the existence of optimal solutions to integer and mixed-integer programming problems
• On the extreme inequalities of infinite group problems
• Operations that preserve the covering property of the lifting region
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II
• T-space and cutting planes
• Two row mixed-integer cuts via lifting
• Unique lifting of integer variables in minimal inequalities

Cited in

(10)

• Gomory integer programs
• Theoretical challenges towards cutting-plane selection
• Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations
• A geometric approach to cut-generating functions
• Structure and interpretation of dual-feasible functions
• On minimal valid inequalities for mixed integer conic programs
• Cut-generating functions
• Sufficiency of cut-generating functions
• Cut-generating functions and S-free sets
• Centerpoints: a link between optimization and convex geometry

This page was built for publication: Cut-generating functions for integer variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833108)