Bin Packing and Cutting Stock Problems: Mathematical Models and Exact Algorithms

作者: Maxence Delorme , Manuel Iori , Silvano Martello

DOI: 10.1016/J.EJOR.2016.04.030

关键词:

摘要: We review the most important mathematical models and algorithms developed for the exact solution of the one-dimensional bin packing and cutting stock problems, and experimentally …

参考文章(156)
György Dósa, Jiří Sgall, Optimal Analysis of Best Fit Bin Packing Automata, Languages, and Programming. pp. 429- 441 ,(2014) , 10.1007/978-3-662-43948-7_36
Claude Berge, Ellis L. Johnson, Coloring the Edges of A Hypergraph and Linear Programming Techniques Studies in Integer Programming. ,vol. 1, pp. 65- 78 ,(1977) , 10.1016/S0167-5060(08)70727-1
Gleb Belov, Guntram Scheithauer, Cláudio Alves, José M. Valério de Carvalho, Gomory Cuts from a Position-Indexed Formulation of 1D Stock Cutting Intelligent Decision Support. pp. 3- 14 ,(2008) , 10.1007/978-3-8349-9777-7_1
Tobias Achterberg, Roland Wunderling, Mixed Integer Programming: Analyzing 12 Years of Progress Springer Berlin Heidelberg. pp. 449- 481 ,(2013) , 10.1007/978-3-642-38189-8_18
Edward G. Coffman, János Csirik, Gábor Galambos, Silvano Martello, Daniele Vigo, Bin packing approximation algorithms: Survey and classification Handbook of Combinatorial Optimization. pp. 455- 531 ,(2013) , 10.1007/978-1-4419-7997-1_35
Richard E. Korf, An improved algorithm for optimal bin packing international joint conference on artificial intelligence. pp. 1252- 1258 ,(2003)
Harald Dyckhoff, Ute Finke, Cutting and Packing in Production and Distribution Contributions to Management Science. ,(1992) , 10.1007/978-3-642-58165-6
M. R. Garey, D. S. Johnson, Approximation Algorithms for Bin Packing Problems: A Survey Springer, Vienna. pp. 147- 172 ,(1981) , 10.1007/978-3-7091-2748-3_8
György Dósa, Rongheng Li, Xin Han, Zsolt Tuza, Tight absolute bound for First Fit Decreasing bin-packing: FFD(L)≤11/9OPT(L)+6/9 Theoretical Computer Science. ,vol. 510, pp. 13- 61 ,(2013) , 10.1016/J.TCS.2013.09.007