An improved best-first branch-and-bound algorithm for constrained two-dimensional guillotine cutting problems

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.51, Iss.6, 2013-03, pp. : 1680-1693

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

An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems

By Kang M. Yoon K.

International Journal of Production Research, Vol. 49, Iss. 15, 2011-08 ,pp. : 4437-4455

Taylor & Francis Ltd

Access to resources Recommend Favorite

Two‐stage two‐dimensional guillotine cutting stock problems with usable leftover

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 23, Iss. 1-2, 2016-01 ,pp. : 121-145

John Wiley & Sons Inc

Access to resources Recommend Favorite

Linear models for 1-group two-dimensional guillotine cutting problems

By Yanasse H. H.

International Journal of Production Research, Vol. 44, Iss. 17, 2006-09 ,pp. : 3471-3491

Taylor & Francis Ltd

Access to resources Recommend Favorite

A note on linear models for two-group and three-group two-dimensional guillotine cutting problems

By Yanasse H. H.

International Journal of Production Research, Vol. 46, Iss. 21, 2008-11 ,pp. : 6189-6206

Taylor & Francis Ltd

Access to resources Recommend Favorite

A competitive branch-and-bound algorithm for the simple assembly line balancing problem

By Sprecher A.

International Journal of Production Research, Vol. 37, Iss. 8, 1999-05 ,pp. : 1787-1816

Taylor & Francis Ltd

Access to resources Recommend Favorite