Cut-Generating Functions

DOI10.1007/978-3-642-36694-9_11zbMath1372.90071OpenAlexW173990134MaRDI QIDQ4910810

Cornuéjols, Gérard, Jérôme Malick, Michele Conforti, Claude Lemaréchal, Aris Daniilidis

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_11

zbMATH Keywords

integer programmingseparationconvex analysis\(S\)-free setsgeneralized gauges

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Operations that Preserve the Covering Property of the Lifting Region, Characterization of the split closure via geometric lifting, Nonunique Lifting of Integer Variables in Minimal Inequalities, Approximation of Corner Polyhedra with Families of Intersection Cuts, Sufficiency of cut-generating functions