An asymptotically exact algorithm for the high-multiplicity bin packing problem

DOI10.1007/s10107-004-0567-yzbMath1115.90047OpenAlexW2057976086MaRDI QIDQ2570998

Alessandro Agnetis, Carlo Filippi

Publication date: 31 October 2005

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

Full work available at URL: https://doi.org/10.1007/s10107-004-0567-y

zbMATH Keywords

complexityalgorithmoptimal solutionbin packing problem

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items

Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions ⋮ High-multiplicity scheduling on one machine with forbidden start and completion times ⋮ On the bin packing problem with a fixed number of object weights ⋮ Feasibility criteria for high-multiplicity partitioning problems

Cites Work

• Unnamed Item
• Unnamed Item
• An application of simultaneous diophantine approximation in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
• Integer Rounding for Polymatroid and Branching Optimization Problems
• The cutting stock problem and integer rounding
• The Linear Diophantine Equation
• On Scheduling Independent Tasks with Restricted Execution Times
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Computing Two-Dimensional Integer Hulls
• Algorithms - ESA 2003