Partial convexification cuts for 0--1 mixed-integer programs
type: Item
instance of: scholarly article
title: Partial convexification cuts for 0--1 mixed-integer programs
zbMATH Open document ID: 1062.90040
author: Hanif D. Sherali
author: Youngho Lee
author: Young-Jin Kim
published in: European Journal of Operational Research
publication date: 2005-04-21T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 2159752
zbMATH Keywords: Integer programming
zbMATH Keywords: Cutting plane
zbMATH Keywords: Branch-and-cut
zbMATH Keywords: Convexification cut
zbMATH Keywords: Reformulation-linearization technique (RLT)
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2002.09.002
OpenAlex ID: W2046559810
cites work: Disjunctive programming: Properties of the convex hull of feasible points
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
cites work: Strengthening cuts for mixed integer programs
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: A Facet Generation Procedure for Solving 0/1 Integer Programs
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: On the generation of deep disjunctive cutting planes
DOI: 10.1016/J.EJOR.2002.09.002
description: scientific article; zbMATH DE number 2159752