Facets of the knapsack polytope derived from disjoint and overlapping index configurations
type: Item
instance of: scholarly article
title: Facets of the knapsack polytope derived from disjoint and overlapping index configurations
zbMATH Open document ID: 0645.90056
DOI: 10.1016/0167-6377(88)90073-9
author: B. George
published in: Operations Research Letters
publication date: 1988-01-01T00:00:00Z
review text: Necessary and sufficient easily verifiable conditions for a class of facets of the knapsack polytope based on two overlapping minimal covers are derived. The conditions are specialized for the case where the minimal covers are disjoint. These conditions may be extended to an arbitrary number of disjoint knapsack constraints. Conditions for facets based on two disjoint (1,k)-configurations are also derived.
reviewed by: J.Mitev
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52Bxx
zbMATH DE Number: 4053348
zbMATH Keywords: facets of the knapsack polytope
zbMATH Keywords: overlapping minimal covers
MaRDI profile type: Publication
full work available at URL: 0167-6377(88)90073-9
OpenAlex ID: W2036575931
cites work: Facets of the knapsack polytope
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: Facet of regular 0–1 polytopes
cites work: Technical Note—A Note on Zero-One Programming
cites work: Covering, Packing and Knapsack Problems
cites work: (1,k)-configurations and facets for packing problems
cites work: Q4138481
cites work: Faces for a linear inequality in 0–1 variables
cites work: Lifting the facets of zero–one polytopes
description: scientific article; zbMATH DE number 4053348