메뉴 건너뛰기




Volumn 4128 LNCS, Issue , 2006, Pages 821-830

A parallel algorithm for the two-dimensional cutting stock problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; PROBLEM SOLVING; REDUNDANCY; SYNTACTICS;

EID: 33750005660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11823285_86     Document Type: Conference Paper
Times cited : (6)

References (19)
  • 1
    • 0026885171 scopus 로고
    • Cutting and packing problems: A categorized, application-orientated research bibliography
    • Sweeney, P.E., Paternoster, E.R.: Cutting and Packing Problems: A categorized, application-orientated research bibliography. Journal of the Operational Research Society 43(7) (1992) 691-706
    • (1992) Journal of the Operational Research Society , vol.43 , Issue.7 , pp. 691-706
    • Sweeney, P.E.1    Paternoster, E.R.2
  • 2
    • 0025210672 scopus 로고
    • A typology of cutting and packing problems
    • Dyckhoff, H.-. A Typology of Cutting and Packing Problems. European Journal of Operational Research 44(2) (1990) 145-159
    • (1990) European Journal of Operational Research , vol.44 , Issue.2 , pp. 145-159
    • Dyckhoff, H.1
  • 4
    • 33750002069 scopus 로고    scopus 로고
    • Applying simulated annealing and the no fit polygon to the nesting problem
    • Arabnia, H.R., ed. CSREA Press ekb@cs.nott.ac.uk, gxk@cs.nott.ac.uk
    • Burke, E., Kendall, G.: Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem. In Arabnia, H.R., ed.: Proceedings of the International Conference on Artificial Intelligence (IC-AI'99). Volume 1., CSREA Press (1999) 51-57 ekb@cs.nott.ac.uk, gxk@cs.nott.ac.uk.
    • (1999) Proceedings of the International Conference on Artificial Intelligence (IC-AI'99) , vol.1 , pp. 51-57
    • Burke, E.1    Kendall, G.2
  • 6
    • 33750028827 scopus 로고
    • Automatic lay planning for irregular shapes on plain fabric. search in direct graph and ε-admissible resolution
    • Compiègne, France
    • Roussel, G., Maouche, S.: Automatic Lay Planning for Irregular Shapes on Plain Fabric. Search in Direct Graph and ε-Admissible Resolution. In: Proceedings of the XVI IFIP-TC7 Conference, Compiègne, France (1993)
    • (1993) Proceedings of the XVI IFIP-TC7 Conference
    • Roussel, G.1    Maouche, S.2
  • 7
    • 0002893433 scopus 로고
    • An algorithm for two-dimensional cutting problems
    • Christofides, N., Whitlock, C.: An Algorithm for Two-Dimensional Cutting Problems. Operations Research 25(1) (1977) 30-44
    • (1977) Operations Research , vol.25 , Issue.1 , pp. 30-44
    • Christofides, N.1    Whitlock, C.2
  • 8
    • 0027629757 scopus 로고
    • Best-first search methods for constrained two-dimensional cutting stock problems
    • Viswanathan, K.V., Bagchi, A.: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems. Operations Research 41(4) (1993) 768-776
    • (1993) Operations Research , vol.41 , Issue.4 , pp. 768-776
    • Viswanathan, K.V.1    Bagchi, A.2
  • 9
    • 0031210357 scopus 로고    scopus 로고
    • An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock
    • Hifi, M.: An Improvement of Viswanathan and Bagchi's Exact Algorithm for Constrained Two-Dimensional Cutting Stock. Computer Operations Research 24(8) (1997) 727-736
    • (1997) Computer Operations Research , vol.24 , Issue.8 , pp. 727-736
    • Hifi, M.1
  • 10
    • 47349104625 scopus 로고    scopus 로고
    • Constrained two-dimensional cutting stock problems: A best-first branch-and-bound algorithm
    • Laboratoire PRiSM - CNRS URA 1525. Université de Versailles, Saint Quentin en Yvelines. 78035 Versailles Cedex, FRANCE
    • Cung, V.D., Hifi, M., Le-Cun, B.: Constrained Two-Dimensional Cutting Stock Problems: A Best-First Branch-and-Bound Algorithm. Technical Report 97/020, Laboratoire PRiSM - CNRS URA 1525. Université de Versailles, Saint Quentin en Yvelines. 78035 Versailles Cedex, FRANCE (1997)
    • (1997) Technical Report , vol.97 , Issue.20
    • Cung, V.D.1    Hifi, M.2    Le-Cun, B.3
  • 11
    • 84957653357 scopus 로고
    • A new parallel approach to the constrained two-dimensional cutting stock problem
    • Ferreira, A., Rolim, J., eds., Berlin, Germany, Springer-Verlag sts@uni-paderborn.de
    • Tschöke, S., Holthöfer, N.: A New Parallel Approach to the Constrained Two-Dimensional Cutting Stock Problem. In Ferreira, A., Rolim, J., eds.: Parallel Algorithms for Irregularly Structured Problems, Berlin, Germany, Springer-Verlag (1995) 285-300 sts@uni-paderborn.de, http://www.uni-paderborn. de/fachbereich/AG/monien/index.html.
    • (1995) Parallel Algorithms for Irregularly Structured Problems , pp. 285-300
    • Tschöke, S.1    Holthöfer, N.2
  • 12
    • 0346547452 scopus 로고    scopus 로고
    • The design and implementation of a Parallel Solution to the Cutting Stock Problem
    • Nicklas, L.D., Atkins, R.W., Setia, S.K., Wang, P.Y.: The Design and Implementation of a Parallel Solution to the Cutting Stock Problem. Concurrency - Practice and Experience 10(10) (1998) 783-805
    • (1998) Concurrency - Practice and Experience , vol.10 , Issue.10 , pp. 783-805
    • Nicklas, L.D.1    Atkins, R.W.2    Setia, S.K.3    Wang, P.Y.4
  • 13
    • 0020748440 scopus 로고
    • Two algorithms for constrained two-dimensional cutting stock problems
    • Wang, P.Y.: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems. Operations Research 31(3) (1983) 573-586
    • (1983) Operations Research , vol.31 , Issue.3 , pp. 573-586
    • Wang, P.Y.1
  • 14
    • 0001648565 scopus 로고
    • The theory and computation of knapsack functions
    • Gilmore, P.C., Gomory, R.E.: The Theory and Computation of Knapsack Functions. Operations Research 14 (1966) 1045-1074
    • (1966) Operations Research , vol.14 , pp. 1045-1074
    • Gilmore, P.C.1    Gomory, R.E.2
  • 16
    • 84956867541 scopus 로고    scopus 로고
    • MaLLBa: A library of skeletons for combinatorial optimization
    • Proceedings of Euro-Par., Paderborn (GE), Springer-Verlag
    • Alba, E., et al: MaLLBa: A Library of Skeletons for Combinatorial Optimization. In: Proceedings of Euro-Par. Volume 2400 of Lecture Notes in Computer Science., Paderborn (GE), Springer-Verlag (2002) 927-932
    • (2002) Lecture Notes in Computer Science , vol.2400 , pp. 927-932
    • Alba, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.