Download:

CGCUT1-CGCUT3

Defined by:

N.Christofides and C.Whitlock. An algorithm for two-dimensional cutting problems. 1977

Referenced by:

Alberto Caprara and Michele Monaci. On the two-dimensional Knapsack Problem. 2004

Van-Dat Cung and Mhand Hifi and Bertrand Le Cun. Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm. 2000

Didier Fayard and Mhand Hifi and Vassilis Zissimopoulos. An efficient approach for large-scale two-dimensional guillotine cutting stock problems. 1998

Mhand Hifi and Vassilis Zissimopoulos. A recursive exact algorithm for weighted two-dimensional cutting. 1996

Mhand Hifi. The DH/KD Algorithm: A Hybrid Approach for Unconstrained Two-Dimensional Cutting Problems. 1997

Mhand Hifi. An improvement of Viswanathan and Bagchi's exact Algorithm for constrained two-dimensional cutting stock. 1997

Sándor Fekete and Jörg Schepers. On More-Dimensional Packing III: Exact Algorithms 1997

Silvano Martello and Michele Monaci and Daniele Vigo. An exact approach to the strip-packing problem. 2003

Tschöke, Stefan and Holthöfer, Norbert. A new parallel approach to the constrained two-dimensional cutting stock problem. 1995