A global optimization method for packing problems
暂无分享,去创建一个
[1] Hermann Gehring,et al. A hybrid genetic algorithm for the container loading problem , 2001, Eur. J. Oper. Res..
[2] Jan Riehme,et al. An efficient approach for the multi-pallet loading problem , 2000, Eur. J. Oper. Res..
[3] Mhand Hifi,et al. Best-first search and dynamic programming methods for cutting problems: the cases of one or more stock plates , 1997 .
[4] Hermann Gehring,et al. A Parallel Genetic Algorithm for Solving the Container Loading Problem , 2002 .
[5] David Pisinger,et al. Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..
[6] Fuh-Hwa F. Liu,et al. A three-dimensional pallet loading method for single-size boxes , 1997 .
[7] Vassilis Zissimopoulos,et al. An approximation algorithm for solving unconstrained two-dimensional knapsack problems , 1995 .
[8] Han-Lin Li,et al. An approximately global optimization method for assortment problems , 1998, Eur. J. Oper. Res..
[9] Chin-Sheng Chen,et al. An analytical model for the container loading problem , 1995 .
[10] Daniel Mack,et al. A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..
[11] W. Dowsland. Three-dimensional packing—solution approaches and heuristic development , 1991 .
[12] J. Beasley. An algorithm for the two-dimensional assortment problem , 1985 .
[13] G. Scheithauer. LP‐based bounds for the container and multi‐container loading problem , 1999 .