Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach

Author： Morabito R.   Arenales M.N.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.94, Iss.3, 1996-11, pp. : 548-560

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

The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems

By Hifi M.  

European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. : 41-52

Elsevier

Access to resources Recommend Favorite

An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container

By Lins L.   Lins S.   Morabito R.  

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

Elsevier

Access to resources Recommend Favorite

The solution of two-stage guillotine cutting stock problems having extremely varying order demands

By Riehme J.   Scheithauer G.   Terno J.  

European Journal of Operational Research, Vol. 91, Iss. 3, 1996-06 ,pp. : 543-552

Elsevier

Access to resources Recommend Favorite

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

A recursive exact algorithm for weighted two-dimensional cutting

By Hifi M.   Zissimopoulos V.  

European Journal of Operational Research, Vol. 91, Iss. 3, 1996-06 ,pp. : 553-564

Elsevier

Access to resources Recommend Favorite