Cutting planes from extended LP formulations
From MaRDI portal
Publication:507316
DOI10.1007/s10107-016-1005-7zbMath1356.90089OpenAlexW2335169303MaRDI QIDQ507316
Oktay Günlük, Sanjeeb Dash, Merve Bodur
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
Related Items
Maximal Quadratic-Free Sets, Binary extended formulations of polyhedral mixed-integer sets, Theoretical challenges towards cutting-plane selection, Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators, On probabilistic algorithm for solving almost all instances of the set partition problem, A theoretical and computational analysis of full strong-branching, Lift-and-project cuts for convex mixed integer nonlinear programs, Fixed-charge transportation problems on trees, Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs, Maximal quadratic-free sets
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the split rank of intersection cuts
- Projection, lifting and extended formulation integer and combinatorial optimization
- Chvátal closures for mixed integer programming problems
- On cutting-plane proofs in combinatorial optimization
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Mixed-integer sets from two rows of two adjacent simplex bases
- On the Rank of Disjunctive Cuts
- On the Practical Strength of Two-Row Tableau Cuts
- The perfectly matchable subgraph polytope of a bipartite graph
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
- The Matching Polytope has Exponential Extension Complexity
- Properties of vertex packing and independence system polyhedra
- Linear vs. semidefinite extended formulations
- Inequalities from Two Rows of a Simplex Tableau
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Extended formulations in combinatorial optimization
- Mixing mixed-integer inequalities
- On the rank of mixed 0,1 polyhedra.
