A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

Author： Alvim Adriana C.F.   Ribeiro Celso C.   Glover Fred   Aloise Dario J.  

Publisher： Springer Publishing Company

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.10, Iss.2, 2004-03, pp. : 205-229

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A new heuristic algorithm for the one-dimensional bin-packing problem

By Gupta J. N. D.   Ho J. C.  

Production Planning and Control, Vol. 10, Iss. 6, 1999-09 ,pp. : 598-603

Taylor & Francis Ltd

Access to resources Recommend Favorite

Exact and approximate methods for a one-dimensional minimax bin-packing problem

By Brusco Michael  

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 611-626

Springer Publishing Company

Access to resources Recommend Favorite

An effective heuristic for the two-dimensional irregular bin packing problem

By López-Camacho Eunice  

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 241-264

Springer Publishing Company

Access to resources Recommend Favorite

Two-dimensional on-line bin packing problem with rotatable items

By Fujita S.   Hada T.  

Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. : 939-952

Elsevier

Access to resources Recommend Favorite

A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing

By Parreño F.  

Annals of Operations Research, Vol. 179, Iss. 1, 2010-09 ,pp. : 203-220

Springer Publishing Company

Access to resources Recommend Favorite