On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
type: Item
instance of: scholarly article
title: On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
zbMATH Open document ID: 0932.90026
DOI: 10.1007/BF02564716
author: Gloria Pérez
author: Laureano F. Escudero Bueno
author: A. Garin
published in: Top
publication date: 1999-09-22T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1340335
zbMATH Keywords: 0-1 program
zbMATH Keywords: knapsack constraint
zbMATH Keywords: maximal cliques
zbMATH Keywords: coefficient increase
zbMATH Keywords: cover
zbMATH Keywords: coefficient reduction
MaRDI profile type: Publication
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: On tightening cover induced inequalities
cites work: Efficient reformulation for 0-1 programs -- methods and computational results
cites work: \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
cites work: \(O(n \log n)\) procedures for tightening cover inequalities
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: Q4040221
cites work: On the facial structure of set packing polyhedra
cites work: On the \(0/1\) knapsack polytope
cites work: Strong formulations for mixed integer programming: A survey
description: scientific article; zbMATH DE number 1340335