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

DOI10.1007/s10107-004-0567-yzbMath1115.90047MaRDI 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

complexity; algorithm; optimal solution; bin packing problem

Mathematics Subject Classification ID

90C10: Integer programming

90C60: Abstract computational complexity for mathematical programming problems

90C27: Combinatorial optimization

Related Items

Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions, On the bin packing problem with a fixed number of object weights

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