An approach to solve cutting stock sheetsBEN MESSAOUD, S; CHU, C; ESPINOUSE, M. L et al.International Conference on Systems, Man and Cybernetics. 2004, isbn 0-7803-8566-7, vol6, 5109-5113Conference Paper

Using Simulated Annealing for paper cutting optimizationMARTINEZ-ALFARO, Horacio; VALENZUELA-RENDON, Manuel.Lecture notes in computer science. 2004, pp 11-20, issn 0302-9743, isbn 3-540-21459-3, 10 p.Conference Paper

Tighter relaxations for the cutting stock problemNITSCHE, C; SCHEITHAUER, G; TERNO, J et al.European journal of operational research. 1999, Vol 112, Num 3, pp 654-663, issn 0377-2217Article

The one-dimensional cutting stock problem with usable leftover : A heuristic approachCHERRI, Adriana Cristina; NEREU ARENALES, Marcos; HIDEKI YANASSE, Horacio et al.European journal of operational research. 2009, Vol 196, Num 3, pp 897-908, issn 0377-2217, 12 p.Article

Two-phase GA-based model to learn generalized hyper-heuristics for the 2D-cutting stock problemTERASHIMA-MARIN, Hugo; FARIAS-ZARATE, Claudia J; ROSS, Peter et al.Lecture notes in computer science. 2006, pp 198-207, issn 0302-9743, isbn 3-540-45462-4, 1Vol, 10 p.Conference Paper

Fast pattern-based algorithms for cutting stockBRANDAO, Filipe; PEDROSO, João Pedro.Computers & operations research. 2014, Vol 48, pp 69-80, issn 0305-0548, 12 p.Article

A PTAS for Cutting Out Polygons with LinesBEREG, Sergey; DAESCU, Ovidiu; MINGHUI JIANG et al.Algorithmica. 2009, Vol 53, Num 2, pp 157-171, issn 0178-4617, 15 p.Article

ILP models for the 2-staged Cutting stockLODI, Andrea; MONACI, Michele.MOSIM '01 : conference francophone de modélisation et simulation. 2001, isbn 1-56555-212-1, 3Vol, V1, 379-384Conference Paper

Roll cutting in the curtain industry, or : A well-solvable allocation problem : Cutting and PackingALFIERI, Arianna; VAN DE VELDE, Steef; WOEGINGER, Gerhard J et al.European journal of operational research. 2007, Vol 183, Num 3, pp 1397-1404, issn 0377-2217, 8 p.Article

A tutorial in irregular shape packing problemsBENNELL, J. A; OLIVEIRA, J. F.The Journal of the Operational Research Society. 2009, Vol 60, issn 0160-5682, S93-S105, SUP1Conference Paper

On finding the maximum number of disjoint cuts in Seymour graphsAGEEV, A. A.Lecture notes in computer science. 1999, pp 490-497, issn 0302-9743, isbn 3-540-66251-0Conference Paper

Resource-constrained project scheduling : Computing lower bounds by solving minimum cut problemsMÖHRING, R. H; SCHULZ, A. S; STORK, F et al.Lecture notes in computer science. 1999, pp 139-150, issn 0302-9743, isbn 3-540-66251-0Conference Paper

New cases of the cutting stock problem having MIRUPNITSCHE, C; SCHEITHAUER, G; TERNO, J et al.Mathematical methods of operations research (Heidelberg). 1998, Vol 48, Num 1, pp 105-115, issn 1432-2994Article

Simple heuristic for the constrained two-dimensional cutting problemCUI, Y; CHEN, Q.Proceedings of the Institution of Mechanical Engineers. Part B. Journal of engineering manufacture. 2012, Vol 226, Num 3, pp 565-572, issn 0954-4054, 8 p.Article

A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cutsCHARALAMBOUS, Christoforos; FLESZAR, Krzysztof.Computers & operations research. 2011, Vol 38, Num 10, pp 1443-1451, issn 0305-0548, 9 p.Article

An hybrid genetic algorithm for two-dimensional cutting problems using guillotine cutsGHARSELLAOUI, Hamza; HASNI, Hamadi.Genetic and evolutionary methods. International conferenceWorldComp'2011. 2011, pp 48-54, isbn 1-60132-182-1, 7 p.Conference Paper

An integer programming model for two- and three-stage two-dimensional cutting stock problemsSILVA, Elsa; ALVELOS, Filipe; VALERIO DE CARVALHO, J. M et al.European journal of operational research. 2010, Vol 205, Num 3, pp 699-708, issn 0377-2217, 10 p.Article

The minimization of open stacks problem: A review of some properties and their use in pre-processing operationsHIDEKI YANASSE, Horacio; FRANCA SENNE, Edson Luiz.European journal of operational research. 2010, Vol 203, Num 3, pp 559-567, issn 0377-2217, 9 p.Article

A note on the approximability of cutting stock problems : Cutting and PackingCINTRA, G. F; MIYAZAWA, F. K; WAKABAYASHI, Y et al.European journal of operational research. 2007, Vol 183, Num 3, pp 1328-1332, issn 0377-2217, 5 p.Article

Carathéodory bounds for integer conesEISENBRAND, Friedrich; SHMONIN, Gennady.Operations research letters. 2006, Vol 34, Num 5, pp 564-568, issn 0167-6377, 5 p.Article

Generating optimal multiple-segment cutting patterns for rectangular blanksCUI, Y; HUANG, L; HE, D et al.Proceedings of the Institution of Mechanical Engineers. Part B. Journal of engineering manufacture. 2004, Vol 218, Num 11, pp 1483-1490, issn 0954-4054, 8 p.Article

Efficient stock cutting for laminated manufacturingKARUNAKARAN, K. P; DIBBI, Shivamurthy; VIVEKANANDA SHANMUGANATHAN, P et al.Computer-aided design. 2002, Vol 34, Num 4, pp 281-298, issn 0010-4485Article

The optimisation of block layout and aisle structure by a genetic algorithmWU, Y; APPLETON, E.Computers & industrial engineering. 2002, Vol 41, Num 4, pp 371-387, issn 0360-8352Article

Quick and precise clustering of arbitrarily shaped flat patterns based on stringy effectCHENG, S. K; RAO, K. P.Computers & industrial engineering. 1997, Vol 33, Num 3-4, pp 485-488, issn 0360-8352Conference Paper

Reducing the number of cuts in generating three-staged cutting patternsYAODONG CUI; BAIXIONG HUANG.European journal of operational research. 2012, Vol 218, Num 2, pp 358-365, issn 0377-2217, 8 p.Article