Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:(%22Cutting stock problem%22)

Filter

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

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

Origin

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

Results 1 to 25 of 181450

  • Page / 7258
Export

Selection :

  • and

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

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 distributed global optimization method for packing problemsLI, H.-L; TSAI, J.-F; HU, N.-Z et al.The Journal of the Operational Research Society. 2003, Vol 54, Num 4, pp 419-425, issn 0160-5682, 7 p.Article

Efficient algorithms for real-life instances of the variable size bin packing problemBANG-JENSEN, Jørgen; LARSEN, Rune.Computers & operations research. 2012, Vol 39, Num 11, pp 2848-2857, issn 0305-0548, 10 p.Article

The inverse inventory problemGREENBERG, I.IIE transactions. 1986, Vol 18, Num 4, pp 398-401, issn 0740-817XArticle

One-dimensional cutting stock optimization in consecutive time periodsTRKMAN, Peter; GRADISAR, Miro.European journal of operational research. 2007, Vol 179, Num 2, pp 291-301, issn 0377-2217, 11 p.Article

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 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

Optimaler Zuschnitt trapezförmiger Teile = Optimal cutting of trapezoidal piecesSCHEITHAUER, G.Wissenschaftliche Zeitschrift der Technischen Universität Dresden. 1990, Vol 39, Num 1, pp 191-195, issn 0043-6925Conference Paper

Evaluating re-order levels and probabilities of stockout during a lead time for some stock-control modelsFONG, D. K. H; GEMPESAW, V. M.The Journal of the Operational Research Society. 1996, Vol 47, Num 2, pp 321-328, issn 0160-5682Article

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

A Multiobjective Gaussian Particle Swarm Approach Applied to Electromagnetic OptimizationDOS SANTOS COELHO, Leandro; HULTMANN AYALA, Helon Vicente; ALOTTO, Piergiorgio et al.IEEE transactions on magnetics. 2010, Vol 46, Num 8, pp 3289-3292, issn 0018-9464, 4 p.Conference Paper

Consecutive optimizers for a partitioning problem with applications to optimal inventory groupings for joint replenishmentCHAKRAVARTY, A. K; ORLIN, J. B; ROTHBLUM, U. G et al.Operations research. 1985, Vol 33, Num 4, pp 820-834, issn 0030-364XArticle

A classification scheme for vehicle routing and scheduling problemsDESROCHERS, M; LENSTRA, J. K; SAVELSBERGH, M. W. P et al.European journal of operational research. 1990, Vol 46, Num 3, pp 322-332, issn 0377-2217, 11 p.Article

Generating optimal two-section cutting patterns for rectangular blanksYAODONG CUI; DONGLI HE; XIAOXIA SONG et al.Computers & operations research. 2006, Vol 33, Num 6, pp 1505-1520, issn 0305-0548, 16 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

The newsboy problem under progressive multiple discountsKHOUJA, M.European journal of operational research. 1995, Vol 84, Num 2, pp 458-466, issn 0377-2217Article

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

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 distribution free newsboy problem with balkingILKYEONG MOON; SANGJIN CHOI.The Journal of the Operational Research Society. 1995, Vol 46, Num 4, pp 537-542, issn 0160-5682Article

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

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

A combined vehicle routing and inventory allocation problemFEDERGRUEN, A; ZIPKIN, P.Operations research. 1984, Vol 32, Num 5, pp 1019-1037, issn 0030-364XArticle

  • Page / 7258