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

ISSN： 0254-5330

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

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 Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

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

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

Springer Publishing Company

Access to resources Recommend Favorite

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

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

An Efficient Processor Allocation Algorithm Using Two-Dimensional Packing

By Hwang I.

Journal of Parallel and Distributed Computing, Vol. 42, Iss. 1, 1997-04 ,pp. : 75-81

Academic Press

Access to resources Recommend Favorite