Friendly bin packing instances without Integer Round-up Property

• 成果类型: Article; Proceedings Paper
• 署名作者: Caprara, Alberto; Dell'Amico, Mauro; Diaz-Diaz, Jose Carlos; Iori, Manuel; Rizzi, Romeo
• 署名单位: Universita di Modena e Reggio Emilia; University of Verona
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-014-0791-z
• 发表日期: 2015
• 页码: 5-17
• 关键词: cutting-stock problem; linear-programming approach

摘要

It is well known that the gap between the optimal values of bin packing and fractional bin packing, if the latter is rounded up to the closest integer, is almost always null. Known counterexamples to this for integer input values involve fairly large numbers. Specifically, the first one was derived in 1986 and involved a bin capacity of the order of a billion. Later in 1998 a counterexample with a bin capacity of the order of a million was found. In this paper we show a large number of counterexamples with bin capacity of the order of a hundred, showing that the gap may be positive even for numbers which arise in customary applications. The associated instances are constructed starting from the Petersen graph and using the fact that it is fractionally, but not integrally, 3-edge colorable.