On facets of knapsack equality polytopes
type: Item
instance of: scholarly article
title: On facets of knapsack equality polytopes
zbMATH Open document ID: 0886.90102
DOI: 10.1023/A:1022624122832
author: Bernhard Rupp
published in: Journal of Optimization Theory and Applications
publication date: 1998-04-19T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 52B12
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 1069780
zbMATH Keywords: knapsack polytopes
zbMATH Keywords: integer programming
zbMATH Keywords: polyhedral theory
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
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: Q4040221
cites work: Faces for a linear inequality in 0–1 variables
cites work: Easily Computable Facets of the Knapsack Polytope
cites work: Solving a truck dispatching scheduling problem using branch-and-cut
cites work: Computing low-capacity 0–1 knapsack polytopes
cites work: Q4138481
cites work: On the \(0/1\) knapsack polytope
description: scientific article; zbMATH DE number 1069780