Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Problema troquelado")

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 249

  • Page / 10
Export

Selection :

  • and

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

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

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

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

An efficient placement heuristic for three-dimensional rectangular packingKUN HE; WENQI HUANG.Computers & operations research. 2011, Vol 38, Num 1, pp 227-233, issn 0305-0548, 7 p.Article

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengthsPOLDI, Kelly Cristina; NEREU ARENALES, Marcos.Computers & operations research. 2009, Vol 36, Num 6, pp 2074-2081, issn 0305-0548, 8 p.Article

Alternative configurations for cutting machines in a tube cutting mill : Cutting and PackingHAJIZADEH, Iman; LEE, Chi-Guhn.European journal of operational research. 2007, Vol 183, Num 3, pp 1385-1396, issn 0377-2217, 12 p.Article

A hybrid heuristic to reduce the number of different patterns in cutting stock problemsHIDEKI YANASSE, Horacio; SARAIVA LIMEIRA, Marcelo.Computers & operations research. 2006, Vol 33, Num 9, pp 2744-2756, issn 0305-0548, 13 p.Article

A PTAS for Cutting Out Polygons with LinesBEREG, Sergey; DAESCU, Ovidiu; MINGHUI JIANG et al.Lecture notes in computer science. 2006, pp 176-185, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Roll cutting in the curtain industryALFIERI, Arianna; VAN DE VELDE, Steef L; WOEGINGER, Gerhard J et al.Lecture notes in computer science. 2005, pp 283-292, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 10 p.Conference Paper

Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problemLEUNG, T. W; YUNG, C. H; TROUTT, Marvin D et al.Computers & industrial engineering. 2001, Vol 40, Num 3, pp 201-214, issn 0360-8352Article

Approximate and exact algorithms for constrained (Un) weighted two-dimensional two-staged cutting stock problemsHIFI, Mhand; ROUCAIROL, Catherine.Journal of combinatorial optimization. 2001, Vol 5, Num 4, pp 465-494, issn 1382-6905Article

A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgradingVASKO, F. J; NEWHART, D. D; STOTT, K. L et al.European journal of operational research. 1999, Vol 114, Num 1, pp 72-82, issn 0377-2217Article

An application of simulated annealing to the cutting stock problemFAINA, L.European journal of operational research. 1999, Vol 114, Num 3, pp 542-556, issn 0377-2217Article

  • Page / 10