Augmented neural networks and problem structure-based heuristics for the bin-packing problem

References

• Agarwal , A . 2009 . Theoretical Insights into the Augmented-Neural-Network Approach for Combinatorial Optimization . Annals of Operations Research , 168 : 101 – 117 .
   Web of Science ®Google Scholar
• Agarwal , A , Colak , S and Deane , J . 2010 . NeuroGenetic Approach for Combinatorial Optimization: An Exploratory Analysis . Annals of Operations Research , 174 : 185 – 199 .
   Web of Science ®Google Scholar
• Agarwal , A , Pirkul , H and Jacob , VS . 2003 . Augmented Neural Networks for Task Scheduling . European Journal of Operational Research , 151(3) : 481 – 502 .
   Web of Science ®Google Scholar
• Alvim , ACF , Ribeiro , CC , Glover , F and Aloise , DJ . 2004 . A Hybrid Improvement Heuristic for the One-dimensional Bin Packing Problem . Journal of Heuristics , 10 : 205 – 229 .
   Web of Science ®Google Scholar
• Anily , S , Bramel , J and Simchi-Levi , D . 1984 . Worst Case Analysis of Heuristics for the Bin-packing Problem with General Cost Structures . Operations Research , 42 : 287 – 298 .
   Web of Science ®Google Scholar
• Brusco , MJ , Thompson , GM and Jacobs , LW . 1997 . A Morph-based Simulated Annealing Heuristic for a Modified Bin-packing Problem . Journal of Operational Research Society , 48 : 433 – 439 .
   Web of Science ®Google Scholar
• Corcoran , AL . Wainwright, R.L. (1993), ‘A Heuristic for Improved Genetic Bin Packing’, Technical Report, UTULSA-MCS-93-8, University of Tulsa, Tulsa, OK
   Google Scholar
• Falkenauer, E. (1996), ‘A Hybrid Grouping Genetic Algorithm for Bin Packing’, Journal of Heuristics, 2, 5–30
   Google Scholar
• Fleszar , K and Hindi , KS . 2002 . New Heuristics for One-dimensional Bin Packing . Computers and Operations Research , 29 : 821 – 839 .
   Web of Science ®Google Scholar
• Garey , MR and Johnson , DS . 1979 . “ Computers and Intractability. A Guide to the Theory of NP-completeness ” . In A Series of Books in the Mathematical Sciences, , 22nd , Edited by: Klee , V . New York : WH Freeman and Company .
   Google Scholar
• Gradisar , M , Resinovic , G and Kljajic , M . 1999 . A Hybrid Approach for Optimization of the One-dimensional Cutting . European Journal of Operational Research , 119 : 719 – 728 .
   Web of Science ®Google Scholar
• Gupta , J and Ho , JC . 1999 . A New Heuristic Algorithm for the One-dimensional Bin-packing Problem . Production Planning and Control , 10 : 598 – 603 .
   Web of Science ®Google Scholar
• Loh , KH , Golden , B and Wasil , E . 2008 . Solving the One-dimensional Bin Packing Problem with a Weight Annealing Heuristic . Computers and Operations Research , 35 : 2283 – 2291 .
   Web of Science ®Google Scholar
• Martello , S and Toth , P . 1990 . Knapsack Problems: Algorithms and Computer Implementations , Chichester , , England : John Wiley and Sons .
   Google Scholar
• Rao , RL and Iyengar , SS . 1994 . Bin Packing by Simulated Annealing . Computers and Mathematics with Applications , 27 : 71 – 82 .
   Web of Science ®Google Scholar
• Reeves , C . 1995 . Hybrid Genetic Algorithms for Bin Packing and Related Problems . Annals of Operations Research , 63 : 371 – 396 .
   Web of Science ®Google Scholar
• Scholl , A , Klein , R and Jtirgens , C . 1997 . BISON: A Fast Hybrid Procedure for Exactly Solving the One-dimensional Bin-packing Problem . Computers and Operations Research , 24 : 627 – 645 .
   Web of Science ®Google Scholar
• Singh , A and Gupta , AK . 2007 . Two Heuristics for the One-dimensional Bin-packing Problem . OR Spectrum , 29 : 765 – 781 .
   Web of Science ®Google Scholar
• Stawowy , A . 2008 . Evolutionary Based Heuristic for Bin Packing Problem . Computers and Industrial Engineering , 55 : 465 – 474 .
   Web of Science ®Google Scholar
• Tambouratzis , T . 2001 . Incremental Bin Packing . Neural, Parallel and Scientific Computations , 9 : 175 – 186 .
   Google Scholar
• Valerio de Carvalho , JM . 1999 . Exact Solution of Bin-packing Problems using Column Generation and Branch-and-Bound . Annals of Operations Research , 86 : 629 – 659 .
   Web of Science ®Google Scholar
• G. Waescher, and Gau, T. (1996), ‘Heuristics for the Integer One-dimensional Cutting Stock Problem: A Computational Study’, OR Spectrum, 18, 131–144
   Google Scholar