Partial convexification cuts for 0--1 mixed-integer programs

DOI10.1016/j.ejor.2002.09.002zbMath1062.90040MaRDI QIDQ1771349

Youngho Lee, Young-Jin Kim, Hanif D. Sherali

Publication date: 21 April 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2002.09.002

zbMATH Keywords

Integer programming; Cutting plane; Branch-and-cut; Convexification cut; Reformulation-linearization technique (RLT)

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C09: Boolean programming

Related Items

Surrogate-RLT cuts for zero-one integer programs, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, A review of recent advances in global optimization, Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design, Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation

Uses Software

• CPLEX

Cites Work

• Strengthening cuts for mixed integer programs
• Disjunctive programming: Properties of the convex hull of feasible points
• 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
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Solving Large-Scale Zero-One Linear Programming Problems
• On the generation of deep disjunctive cutting planes
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• A Facet Generation Procedure for Solving 0/1 Integer Programs