An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
type: Item
instance of: scholarly article
title: An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
zbMATH Open document ID: 1042.90035
DOI: 10.1016/S0167-6377(02)00221-3
published in: Operations Research Letters
publication date: 2003-06-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1929386
zbMATH Keywords: Knapsack polytope
zbMATH Keywords: Facet-defining inequalities
zbMATH Keywords: Strong minimal covers
zbMATH Keywords: Tightening procedures
author: Laureano F. Escudero Bueno
author: A. Garin
author: Gloria Pérez
MaRDI profile type: Publication
cites work: Facets of the knapsack polytope
cites work: Canonical Cuts on the Unit Hypercube
cites work: Facets of the Knapsack Polytope From Minimal Covers
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: Sequence independent lifting of cover inequalities
cites work: Facet of regular 0–1 polytopes
cites work: Properties of vertex packing and independence system polyhedra
cites work: Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: On the facial structure of set packing polyhedra
cites work: Technical Note—A Note on Zero-One Programming
cites work: On the \(0/1\) knapsack polytope
cites work: Faces for a linear inequality in 0–1 variables
cites work: Easily Computable Facets of the Knapsack Polytope
description: scientific article; zbMATH DE number 1929386