A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
From MaRDI portal
Publication:433830
DOI10.1016/j.orl.2011.10.009zbMath1242.90123OpenAlexW2063991361MaRDI QIDQ433830
Binyuan Chen, Suvrajeet Sen, Simge Küçükyavuz
Publication date: 6 July 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.10.009
Related Items
Optimal crashing of an activity network with disruptions, Theoretical challenges towards cutting-plane selection, The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
Uses Software
Cites Work
- Unnamed Item
- A heuristic to generate rank-1 GMI cuts
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- Lift-and-project for mixed 0-1 programming: recent progress
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- MIR closures of polyhedral sets
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- Optimization with disjunctive constraints
- Partial convexification cuts for 0--1 mixed-integer programs
- Convex normalizations in lift-and-project methods for 0--1 programming
- MIPLIB 2003
- Optimizing over the split closure
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- A convex-analysis perspective on disjunctive cuts
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- A disjunctive cutting plane procedure for general mixed-integer linear programs
