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

An exact two-dimensional non-guillotine cutting tree search procedureBEASLEY, J. E.Operations research. 1985, Vol 33, Num 1, pp 49-64, issn 0030-364XArticle

Performance testing of rectangular partsnesting heuristicsISRANI, S. S; SANDERS, J. L.International journal of production research. 1985, Vol 23, Num 3, pp 437-456, issn 0020-7543Article

TWO ALGORITHMS FOR CONSTRAINED TWO-DIMENSIONAL CUTTING STOCK PROBLEMSWANG PY.1983; OPERATIONS RESEARCH; ISSN 0030-364X; USA; DA. 1983; VOL. 31; NO 3; PP. 573-586; BIBL. 4 REF.Article

THE CUTTING STOCK PROBLEM WITH SEVERAL OBJECTIVE FUNCTIONS AND IN FUZZY CONDITIONSFABIAN C; DUTA DL.1982; ECON. COMPUT. ECON. CYBERN. STUD. RES.; ISSN 0424-267X; ROM; DA. 1982; VOL. 17; NO 2; PP. 43-47; ABS. FRE/RUS; BIBL. 5 REF.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

Composite stock cutting through simulated annealingHANAN LUTFIYYA; MCMILLIN, B; PIPATPONG POSHYANONDA et al.Mathematical and computer modelling. 1992, Vol 16, Num 1, pp 57-74, issn 0895-7177Article

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

Placements de polygones en translation et rotation = in translation and rotation polygon placementsAMET, H; PORTMANN, M.-C.Journal européen des systèmes automatisés. 1996, Vol 30, Num 1, pp 85-102, issn 1269-6935Article

Near-optimal solutions to one-dimensional cutting stock problemsROODMAN, G. M.Computers & operations research. 1986, Vol 13, Num 6, pp 713-719, issn 0305-0548Article

An algorithm for the two-dimensional assortment problemBEASLEY, J. E.European journal of operational research. 1985, Vol 19, Num 2, pp 253-261, issn 0377-2217Article

Problèmes de découpe : «algorithmes ε-approchants» = Cutting stock problems : «ε-approximate algorithms»ZISSIMOPOULOS, Vassilis.1984, 204 pThesis

Bounds for two-dimensional cuttingBEASLEY, J. E.The Journal of the Operational Research Society. 1985, Vol 36, Num 1, pp 71-74, issn 0160-5682Article

Trim loss and related problemsDYCKHOFF, H; KRUSE, H.-J; ABEL, D et al.Omega (Oxford). 1985, Vol 13, Num 1, pp 59-72, issn 0305-0483Article

Une étude pratique de découpes de panneaux de bois = A wood boards cutting problem in a furniture factoryCOSTA, M. C.RAIRO. Recherche opérationnelle. 1984, Vol 18, Num 3, pp 211-219, issn 0399-0559Article

PACKING RECTANGULAR PIECES - A HEURISTIC APPROACHBENGTSSON BE.1982; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1982; VOL. 25; NO 3; PP. 353-357; BIBL. 10 REF.Article

DECOMPOSITION DES PROBLEMES DE DECOUPE LINEAIRETENEV TT.1978; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1978; NO 5; PP. 56-61; BIBL. 5 REF.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