Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Emanuel Falkenauer,et al. A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.
[3] Michael A. Langston,et al. Analysis of a Compound bin Packing Algorithm , 1991, SIAM J. Discret. Math..
[4] José M. Valério de Carvalho,et al. LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..
[5] Teodor Gabriel Crainic,et al. Computing the asymptotic worst-case of bin packing lower bounds , 2007, Eur. J. Oper. Res..
[6] A. K. Bhatia,et al. Packing Bins Using Multi-chromosomal Genetic Representation and Better-Fit Heuristic , 2004, ICONIP.
[7] Gerhard Wäscher,et al. Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .
[8] Alberto Caprara,et al. Worst-case analysis of the subset sum algorithm for bin packing , 2004, Oper. Res. Lett..
[9] Philipp Rohlfshagen,et al. A genetic algorithm with exon shuffling crossover for hard bin packing problems , 2007, GECCO '07.
[10] Jatinder N. D. Gupta,et al. A new heuristic algorithm for the one-dimensional bin-packing problem , 1999 .
[11] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[12] Alok Singh,et al. Two heuristics for the one-dimensional bin-packing problem , 2007, OR Spectr..
[13] José M. Valério de Carvalho,et al. Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..
[14] Armin Scholl,et al. Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..
[15] Riccardo Poli,et al. A histogram-matching approach to the evolution of bin-packing strategies , 2007, 2007 IEEE Congress on Evolutionary Computation.
[16] Krzysztof Fleszar,et al. New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..
[17] Teodor Gabriel Crainic,et al. New bin packing fast lower bounds , 2007, Comput. Oper. Res..
[18] François Vanderbeck,et al. Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..
[19] Gerhard Wäscher,et al. The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .
[20] Alberto Caprara,et al. Modified subset sum heuristics for bin packing , 2005, Inf. Process. Lett..
[21] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[22] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .
[23] Sándor P. Fekete,et al. New classes of fast lower bounds for bin packing problems , 2001, Math. Program..
[24] Fred W. Glover,et al. A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem , 2004, J. Heuristics.
[25] Bruce L. Golden,et al. Solving the one-dimensional bin packing problem with a weight annealing heuristic , 2008, Computers & Operations Research.
[26] Gleb Belov,et al. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..