Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
暂无分享,去创建一个
Cláudio Alves | Jürgen Rietz | José M. Valério de Carvalho | François Clautiaux | J. V. D. Carvalho | Cláudio Alves | François Clautiaux | J. Rietz
[1] Jacques Carlier,et al. New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation , 2007, Comput. Oper. Res..
[2] L. V. Kantorovich,et al. Mathematical Methods of Organizing and Planning Production , 1960 .
[3] Gerhard J. Woeginger,et al. There is no Asymptotic PTAS for Two-Dimensional Vector Packing , 1997, Inf. Process. Lett..
[4] Sándor P. Fekete,et al. New classes of fast lower bounds for bin packing problems , 2001, Math. Program..
[5] Alberto Caprara,et al. A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing , 2009, SIAM J. Comput..
[6] J. O. Berkey,et al. Two-Dimensional Finite Bin-Packing Algorithms , 1987 .
[7] George S. Lueker,et al. Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[8] Hans Kellerer,et al. An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing , 2003, Oper. Res. Lett..
[9] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.
[10] S. Martello,et al. Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .
[11] Cláudio Alves,et al. Theoretical investigations on maximal dual feasible functions , 2010, Oper. Res. Lett..
[12] Frits C. R. Spieksma,et al. A branch-and-bound algorithm for the two-dimensional vector packing problem , 1994, Comput. Oper. Res..
[13] Cláudio Alves,et al. A survey of dual-feasible and superadditive functions , 2010, Ann. Oper. Res..
[14] Alberto Caprara,et al. Properties of some ILP Formulations of a Class of Partitioning Problems , 1998, Discret. Appl. Math..
[15] Leah Epstein,et al. Multidimensional Packing Problems , 2018, Handbook of Approximation Algorithms and Metaheuristics.
[16] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[17] Andrew Chi-Chih Yao,et al. Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.
[18] Soo Y. Chang,et al. A two-dimensional vector packing model for the efficient use of coil cassettes , 2005, Comput. Oper. Res..
[19] Jacques Carlier,et al. Computing redundant resources for the resource constrained project scheduling problem , 2007, Eur. J. Oper. Res..
[20] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.
[21] G. S. Lueker,et al. Bin packing can be solved within 1 + ε in linear time , 1981 .
[22] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[23] Paolo Toth,et al. Lower bounds and algorithms for the 2-dimensional vector packing problem , 2001, Discret. Appl. Math..
[24] Claude-Alain Burdet,et al. A Subadditive Approach to Solve Linear Integer Programs , 1977 .
[25] Sanjeev Khanna,et al. On Multidimensional Packing Problems , 2004, SIAM J. Comput..