Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry

By Kim Kyungdoc   Kim Byung-In   Cho Hyunbo  

International Journal of Production Research, Vol. 52, Iss. 19, 2014-10 ,pp. : 5675-5689

Taylor & Francis Ltd

Access to resources Recommend Favorite

Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms

By Babu A.R.   Babu N.R.  

International Journal of Production Research, Vol. 37, Iss. 7, 1999-05 ,pp. : 1625-1643

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient intelligent search algorithm for the two‐dimensional rectangular strip packing problem

By  

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

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

By Yoon K.   Ahn S.   Kang M.  

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

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