Extending Dantzig's bound to the bounded multiple-class binary knapsack problem

DOI10.1007/s10107-002-0300-7zbMath1023.90054OpenAlexW2042487200MaRDI QIDQ1396817

François Vanderbeck

Publication date: 13 July 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0300-7

zbMATH Keywords

integer programmingknapsack problemlinear programming relaxationcutting stock problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation, Branching in branch-and-price: A generic scheme, Comparison of bundle and classical column generation, Knapsack problems with setups