On the bin packing problem with a fixed number of object weights

DOI10.1016/j.ejor.2006.06.016zbMath1121.90108OpenAlexW2003686551MaRDI QIDQ872247

Carlo Filippi

Publication date: 27 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.016

zbMATH Keywords

bin packingcutting stockhigh-multiplicityinteger round-up property

Mathematics Subject Classification ID

Integer programming (90C10) Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27)

Related Items (1)

Integer rounding and modified integer rounding for the skiving stock problem

Cites Work

• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Worst-case analyses, linear programming and the bin-packing problem
• New cases of the cutting stock problem having MIRUP
• Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
• Exploiting orbits in symmetric ILP
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• Ranking lower bounds for the bin-packing problem
• Carathéodory bounds for integer cones
• An asymptotically exact algorithm for the high-multiplicity bin packing problem
• A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
• The cutting stock problem and integer rounding
• Algorithms - ESA 2003

This page was built for publication: On the bin packing problem with a fixed number of object weights