Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
type: Item
instance of: scholarly article
title: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
zbMATH Open document ID: 0835.90052
DOI: 10.1016/0166-218X(95)90600-K
author: Yves Pochet
author: Laurence A. Wolsey
published in: Discrete Applied Mathematics
publication date: 1995-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 756145
zbMATH Keywords: network design
zbMATH Keywords: knapsack
zbMATH Keywords: convex hulls
zbMATH Keywords: separation
MaRDI profile type: Publication
cites work: Some polyhedra related to combinatorial problems
cites work: When the Greedy Solution Solves a Class of Knapsack Problems
cites work: The cutting stock problem and integer rounding
cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
full work available at URL: 0166-218x(95)90600-k
OpenAlex ID: W2009082978
description: scientific article; zbMATH DE number 756145