Surrogate-RLT cuts for zero-one integer programs
From MaRDI portal
Publication:330260
DOI10.1007/S10898-015-0297-0zbMATH Open1355.90052OpenAlexW1999231207MaRDI QIDQ330260FDOQ330260
Authors: Junsang Yuh, Youngho Lee 
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
Recommendations
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
- A surrogate cutting plane algorithm for all-integer programming
- On the surrogate constraint and the core of a linear mixed-integer 0–1 program with few constraints
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Publication:4206317
- On the complexity of the surrogate dual of 0–1 programming
- scientific article; zbMATH DE number 1497345
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
- Cuts for mixed 0-1 conic programming
integer programmingreformulation-linearization techniquecutting planepartial convexification cutssurrogate constraint analysissurrogate-RLT cuts
Cites Work
- On generating maximal nondominated Benders cuts
- 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
- Title not available (Why is that?)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- On optimizing over lift-and-project closures
- Optimizing over the split closure
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- 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
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
Uses Software
This page was built for publication: Surrogate-RLT cuts for zero-one integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330260)
