A disjunctive cutting plane procedure for general mixed-integer linear programs
From MaRDI portal
Publication:5930736
DOI10.1007/s101070000179zbMath1017.90066MaRDI QIDQ5930736
Sanjay Mehrotra, Jonathan H. Owen
Publication date: 3 October 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Disjunctive Cuts for Nonconvex MINLP, Binary extended formulations of polyhedral mixed-integer sets, Theoretical challenges towards cutting-plane selection, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, On the facet defining inequalities of the mixed-integer bilinear covering set, Relaxations of mixed integer sets from lattice-free polyhedra, Further results on an abstract model for branching and its application to mixed integer programming, The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming, On the relative strength of different generalizations of split cuts, Cook, Kannan and Schrijver's example revisited, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, Cutting planes in integer and mixed integer programming, Relaxations of mixed integer sets from lattice-free polyhedra, On convergence in mixed integer programming, Depth-optimized convexity cuts, B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
