Sequence based heuristics for two-dimensional bin packing problems

ISSN： 0305-215X

Source： Engineering Optimization, Vol.41, Iss.8, 2009-08, pp. : 773-791

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

Two-dimensional packing problems: A survey

By Lodi A. Martello S. Monaci M.

European Journal of Operational Research, Vol. 141, Iss. 2, 2002-09 ,pp. : 241-252

Elsevier

Access to resources Recommend Favorite

Approximation algorithms for the oriented two-dimensional bin packing problem

By Lodi A. Martello S. Vigo D.

European Journal of Operational Research, Vol. 112, Iss. 1, 1999-01 ,pp. : 158-166

Elsevier

Access to resources Recommend Favorite

LP models for bin packing and cutting stock problems

By Valerio de Carvalho J.M.

European Journal of Operational Research, Vol. 141, Iss. 2, 2002-09 ,pp. : 253-273

Elsevier

Access to resources Recommend Favorite

Heuristic algorithms for the three-dimensional bin packing problem

By Lodi A. Martello S. Vigo D.

European Journal of Operational Research, Vol. 141, Iss. 2, 2002-09 ,pp. : 410-420

Elsevier

Access to resources Recommend Favorite

Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

By Leung T.W. Chan C.K. Troutt M.D.

European Journal of Operational Research, Vol. 145, Iss. 3, 2003-03 ,pp. : 530-542

Elsevier

Access to resources Recommend Favorite