On t-branch split cuts for mixed-integer programs

DOI10.1007/S10107-012-0542-YzbMATH Open1280.90089OpenAlexW2123104364MaRDI QIDQ378102FDOQ378102

Authors: Sanjeeb Dash, Oktay Günlük 

Publication date: 11 November 2013

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

Full work available at URL: https://doi.org/10.1007/s10107-012-0542-y

Recommendations

• scientific article; zbMATH DE number 1488891
• Split cuts for robust mixed-integer optimization
• Classical cuts for mixed-integer programming and branch-and-cut
• Classical cuts for mixed-integer programming and branch-and-cut
• A branch-and-cut algorithm for mixed-integer bilinear programming
• Split cuts and extended formulations for mixed integer conic quadratic programming
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• scientific article; zbMATH DE number 2084777
• An optimality cut for mixed integer linear programs
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization

zbMATH Keywords

convex hull

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)

Cites Work

• Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming

Cited In (12)

• Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
• Theoretical challenges towards cutting-plane selection
• Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
• Characterization of the split closure via geometric lifting
• Partial hyperplane activation for generalized intersection cuts
• Complexity of optimizing over the integers
• Cook, Kannan and Schrijver's example revisited
• On the relative strength of different generalizations of split cuts
• On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
• On polytopes with linear rank with respect to generalizations of the split closure
• Lattice closures of polyhedra
• Classical cuts for mixed-integer programming and branch-and-cut

This page was built for publication: On \(t\)-branch split cuts for mixed-integer programs

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