Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Problème découpe")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 339

  • Page / 14
Export

Selection :

  • and

The cutting stock problem and integer roundingMARCOTTE, O.Mathematical programming. 1985, Vol 33, Num 1, pp 82-92, issn 0025-5610Article

An improved typology of cutting and packing problems : Cutting and PackingWÄSCHER, Gerhard; HAUSSNER, Heike; SCHUMANN, Holger et al.European journal of operational research. 2007, Vol 183, Num 3, pp 1109-1130, issn 0377-2217, 22 p.Article

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

LOWER BOUNDS FOR ON-LINE TWO-DIMENSIONAL PACKING ALGORITHMSBROWN DJ; BAKER BS; KATSEFF HP et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 2; PP. 207-225; BIBL. 11 REF.Article

A rapid scheduling method with resource selection by flaw analysis for a rectangular cutting stock problem against flawed and connectable resourcesCHUJO, Hiroaki; SHONO, Yuji; IKKAI, Yoshitomo et al.International Conference on Systems, Man and Cybernetics. 2004, isbn 0-7803-8566-7, vol2, 1458-1463Conference Paper

An instance of the cutting stock problem for which the rounding property does not holdMARCOTTE, O.Operations research letters. 1986, Vol 4, Num 5, pp 239-243, issn 0167-6377Article

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

The modified integer round-up property of the one-dimensional cutting stock problemSCHEITHAUER, G; TERNO, J.European journal of operational research. 1995, Vol 84, Num 3, pp 562-571, issn 0377-2217Article

Practical considerations of the pallet-loading problemCARPENTER, H; DOWSLAND, W. B.The Journal of the Operational Research Society. 1985, Vol 36, Num 6, pp 489-497, issn 0160-5682Article

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

Multi-job cutting stock problem with due dates and release datesLI, S.The Journal of the Operational Research Society. 1996, Vol 47, Num 4, pp 490-510, issn 0160-5682Article

CUTGEN1: a problem generator for the standard one-dimensional cutting stock problemGAU, T; WÄSCHER, G.European journal of operational research. 1995, Vol 84, Num 3, pp 572-579, issn 0377-2217Article

A search strategy for the one-size assortment problemYANASSE, H. H.European journal of operational research. 1994, Vol 74, Num 1, pp 135-142, issn 0377-2217Article

The cutting stock problem - a surveyCHENG, C. H; FEIRING, B. R; CHENG, T. C. E et al.International journal of production economics. 1994, Vol 36, Num 3, pp 291-305, issn 0925-5273Article

An approach to two-dimensional cutting stock problemsDAGLI, C. H; TATOGLU, M. Y.International journal of production research. 1987, Vol 25, Num 2, pp 175-190, issn 0020-7543Article

Algorithms for unconstrained two-dimensional guillotine cuttingBEASLEY, J. E.The Journal of the Operational Research Society. 1985, Vol 36, Num 4, pp 297-306, issn 0160-5682Article

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

  • Page / 14