Cutting planes from extended LP formulations
From MaRDI portal
Publication:507316
DOI10.1007/S10107-016-1005-7zbMATH Open1356.90089OpenAlexW2335169303MaRDI QIDQ507316FDOQ507316
Authors: Merve Bodur, Sanjeeb Dash, Oktay Günlük 
Publication date: 3 February 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-016-1005-7
Recommendations
- Cutting planes in integer and mixed integer programming
- Binary extended formulations of polyhedral mixed-integer sets
- Chvátal closures for mixed integer programming problems
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Strong formulations for mixed integer programs: valid inequalities and extended formulations
Cites Work
- Properties of vertex packing and independence system polyhedra
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Title not available (Why is that?)
- Linear vs. semidefinite extended formulations
- Inequalities from Two Rows of a Simplex Tableau
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- The Matching Polytope has Exponential Extension Complexity
- Mixing mixed-integer inequalities
- Extended formulations in combinatorial optimization
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Chvátal closures for mixed integer programming problems
- Projection, lifting and extended formulation integer and combinatorial optimization
- The perfectly matchable subgraph polytope of a bipartite graph
- On cutting-plane proofs in combinatorial optimization
- Mixed-integer sets from two rows of two adjacent simplex bases
- On the rank of disjunctive cuts
- Title not available (Why is that?)
- On mixing inequalities: rank, closure, and cutting-plane proofs
- Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
- A note on the split rank of intersection cuts
- On the practical strength of two-row tableau cuts
- Strengthened benders cuts for stochastic integer programs with continuous recourse
- On the rank of mixed 0,1 polyhedra.
Cited In (14)
- Lifting linear extension complexity bounds to the mixed-integer setting
- Cutting planes and the parameter cutwidth
- Maximal quadratic-free sets
- Maximal quadratic-free sets
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Theoretical challenges towards cutting-plane selection
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- Binary extended formulations of polyhedral mixed-integer sets
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators
- Lattice reformulation cuts
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- Fixed-charge transportation problems on trees
- On probabilistic algorithm for solving almost all instances of the set partition problem
- A theoretical and computational analysis of full strong-branching
This page was built for publication: Cutting planes from extended LP formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507316)
