Surrogate-RLT cuts for zero-one integer programs
From MaRDI portal
Publication:330260
DOI10.1007/s10898-015-0297-0zbMath1355.90052OpenAlexW1999231207MaRDI QIDQ330260
Publication date: 25 October 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0297-0
integer programmingcutting planereformulation-linearization techniquepartial convexification cutssurrogate constraint analysissurrogate-RLT cuts
Uses Software
Cites Work
- Unnamed Item
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
- Foundation-penalty cuts for mixed-integer programs.
- Partial convexification cuts for 0--1 mixed-integer programs
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- Tighter representations for set partitioning problems
- RLT insights into lift-and-project closures
- On optimizing over lift-and-project closures
- On generating maximal nondominated Benders cuts
- Optimizing over the split closure
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- A note on the selection of Benders' cuts
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
This page was built for publication: Surrogate-RLT cuts for zero-one integer programs
