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.009zbMATH Open1242.90123OpenAlexW2063991361MaRDI QIDQ433830FDOQ433830
Authors: Binyuan Chen, Simge Küçükyavuz, Suvrajeet Sen 
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
Recommendations
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- A simple finite cutting plane algorithm for integer programs
- scientific article; zbMATH DE number 2084777
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- Computational Integer Programming and Cutting Planes
Cites Work
- MIPLIB 2003
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Disjunctive Programming
- Lift-and-project for mixed 0-1 programming: recent progress
- Optimizing over the split closure
- A heuristic to generate rank-1 GMI cuts
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Partial convexification cuts for 0--1 mixed-integer programs
- A convex-analysis perspective on disjunctive cuts
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- MIR closures of polyhedral sets
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- Optimization with disjunctive constraints
- Convex normalizations in lift-and-project methods for 0--1 programming
- Title not available (Why is that?)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
Cited In (8)
- Testing cut generators for mixed-integer linear programming
- Theoretical challenges towards cutting-plane selection
- Optimal crashing of an activity network with disruptions
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Decomposition methods for global solution of mixed-integer linear programs
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs
Uses Software
This page was built for publication: A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433830)
