A convex-analysis perspective on disjunctive cuts

From MaRDI portal
Publication:2492679

DOI10.1007/s10107-005-0670-8zbMath1149.90175OpenAlexW1972733676MaRDI QIDQ2492679

Cornuéjols, Gérard, Claude Lemaréchal

Publication date: 14 June 2006

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

Full work available at URL: https://doi.org/10.1007/s10107-005-0670-8

zbMATH Keywords

Integer programmingSeparationConvex analysisCutting planesLift and projectDisjunctive cut


Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Optimality conditions and duality in mathematical programming (90C46) Convex functions and convex programs in convex geometry (52A41)


Related Items

Computing deep facet-defining disjunctive cuts for mixed-integer programming, A note on the selection of Benders' cuts, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization, An implementation of exact knapsack separation, Theoretical challenges towards cutting-plane selection, Two-term disjunctions on the second-order cone, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, Reflections on generating (disjunctive) cuts, How to convexify the intersection of a second order cone and a nonconvex quadratic, Quasiconvex minimization on a locally finite union of convex sets, A computational study of exact knapsack separation for the generalized assignment problem, Unnamed Item, Refined cut selection for Benders decomposition: applied to network capacity expansion problems, ``Facet separation with one linear program, Cut-Generating Functions and S-Free Sets



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2492679&oldid=15195809"
Powered by MediaWiki