Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
type: Item
instance of: scholarly article
title: Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
zbMATH Open document ID: 0805.90079
DOI: 10.1016/0377-2217(94)90250-X
author: Brenda L. Dietrich
author: Laureano F. Escudero Bueno
published in: European Journal of Operational Research
publication date: 1994-07-26T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 611366
zbMATH Keywords: clique and cover induced inequalities
zbMATH Keywords: 0-1 knapsack constraints
zbMATH Keywords: Chvatal- Gomory inequalities
MaRDI profile type: Publication
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
cites work: Efficient reformulation for 0-1 programs -- methods and computational results
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
cites work: Q4040221
description: scientific article; zbMATH DE number 611366