Surrogate-RLT cuts for zero-one integer programs
type: Item
instance of: scholarly article
title: Surrogate-RLT cuts for zero-one integer programs
zbMATH Open document ID: 1355.90052
author: Junsang Yuh
author: Youngho Lee
published in: Journal of Global Optimization
publication date: 2016-10-25T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6643058
zbMATH Keywords: integer programming
zbMATH Keywords: cutting plane
zbMATH Keywords: reformulation-linearization technique
zbMATH Keywords: surrogate constraint analysis
zbMATH Keywords: partial convexification cuts
zbMATH Keywords: surrogate-RLT cuts
describes a project that uses: MIPLIB
MaRDI profile type: Publication
full work available at URL: s10898-015-0297-0
OpenAlex ID: W1999231207
cites work: RLT insights into lift-and-project closures
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
cites work: Optimizing over the split closure
cites work: On optimizing over lift-and-project closures
cites work: Projected Chvátal-Gomory cuts for mixed integer linear programs
cites work: Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
cites work: A note on the selection of Benders' cuts
cites work: Foundation-penalty cuts for mixed-integer programs.
cites work: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
cites work: Q4943600
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
cites work: Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
cites work: Tighter representations for set partitioning problems
cites work: A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
cites work: Partial convexification cuts for 0--1 mixed-integer programs
cites work: On generating maximal nondominated Benders cuts
cites work: Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
DOI: 10.1007/S10898-015-0297-0
Recommended article: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
Recommended article: A surrogate cutting plane algorithm for all-integer programming
Recommended article: On the surrogate constraint and the core of a linear mixed-integer 0–1 program with few constraints
Recommended article: Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
Recommended article: Q4206317
Recommended article: On the complexity of the surrogate dual of 0–1 programming
Recommended article: Q4499027
Recommended article: Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
Recommended article: Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
Recommended article: Cuts for mixed 0-1 conic programming
description: scientific article; zbMATH DE number 6643058