An Improved Knapsack Solver for Column Generation

DOI10.1007/978-3-642-38536-0_2zbMath1344.68287OpenAlexW2244377482MaRDI QIDQ4928469

Stefan Kraft, Klaus Jansen

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_2

zbMATH Keywords

column generationknapsack problemvariable-sized bin packingbounded knapsack problemunbounded knapsack problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

A faster FPTAS for the unbounded knapsack problem ⋮ An improved approximation scheme for variable-sized bin packing

This page was built for publication: An Improved Knapsack Solver for Column Generation