An asymptotically exact algorithm for the high-multiplicity bin packing problem
- 9 February 2005
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 104 (1), 21-37
- https://doi.org/10.1007/s10107-004-0567-y
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Polynomial Algorithm for Multiprocessor Scheduling with Two Job LengthsMathematics of Operations Research, 2001
- Computing Two-Dimensional Integer HullsSIAM Journal on Computing, 1999
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling ProblemOperations Research, 1991
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Science and Business Media LLC ,1988
- Ein Planungssystem zur Optimierung der Palettenbeladung mit kongruenten rechteckigen VersandgebindenOR Spectrum, 1987
- An application of simultaneous diophantine approximation in combinatorial optimizationCombinatorica, 1987
- The cutting stock problem and integer roundingMathematical Programming, 1985
- On Scheduling Independent Tasks with Restricted Execution TimesOperations Research, 1982
- Integer Rounding for Polymatroid and Branching Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1981
- The Linear Diophantine EquationThe American Mathematical Monthly, 1981