Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
type: Item
instance of: scholarly article
title: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
zbMATH Open document ID: 0755.90062
author: Manfred Padberg
author: Karla L. Hoffman
published in: ORSA Journal on Computing
publication date: 1993-02-18T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 124252
zbMATH Keywords: zero-one linear programming
zbMATH Keywords: detection of redundant rows
zbMATH Keywords: variable elimination
zbMATH Keywords: special-ordered-set constraints
zbMATH Keywords: branch-and-cut
zbMATH Keywords: preprocessing
describes a project that uses: GAMS
MaRDI profile type: Publication
full work available at URL: ijoc.3.2.121
OpenAlex ID: W1965772065
DOI: 10.1287/IJOC.3.2.121
Recommended article: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Recommended article: Zero-one integer programs with few constraints - Efficient branch and bound algorithms
Recommended article: An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems
Recommended article: An improved linearization strategy for zero-one quadratic programming problems
Recommended article: Q5272522
Recommended article: A branch-and-cut method for 0-1 mixed convex programming
Recommended article: An improved linearization technique for a class of quadratic 0-1 programming problems
Recommended article: Q4414642
Recommended article: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
Recommended article: Solving linear programs with complementarity constraints using branch-and-cut
description: scientific article