AVERAGE-CASE ANALYSIS OF CUTTING AND PACKING IN 2 DIMENSIONS

被引:43
|
作者
COFFMAN, EG
SHOR, PW
机构
[1] AT and T Bell Laboratories, 20-1155 Murray Hill
关键词
asymptotic analysis; average-case performance; cutting and packing algorithms; trim loss analysis; Two-dimensional cutting; two-dimensional packing;
D O I
10.1016/0377-2217(90)90349-G
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Stock-cutting and packing in two dimensions is a source of problems of great practical significance. Much has been written on the subject, including several surveys, but the focus of the mathematically oriented research has been largely on combinatorial optimization and worst-case analysis. Recently, substantial progress has been made in the average-case analysis of algorithms for two-dimensional packing. This paper reviews selected, illustrative results in this area of research, and discusses desirable extensions and open problems. Several cutting and packing algorithms are defined and the results of their probabilistic analysis reported. From the presentation of this material it is clear that the field is still in early stages of development; the algorithms and probability models tend to be simplistic, and stimates of performance are far more common that exact measures. In spite of these limitations, valuable and in some cases unexpected insights have emerged. © 1990.
引用
收藏
页码:134 / 144
页数:11
相关论文
共 50 条
  • [31] Average-case analysis of greedy packet scheduling
    Lotker, Z
    Patt-Shamir, B
    THEORY OF COMPUTING SYSTEMS, 2002, 35 (06) : 667 - 683
  • [32] Average-Case Analysis of Algorithms UsingKolmogorov Complexity
    姜涛
    李明
    JournalofComputerScienceandTechnology, 2000, (05) : 402 - 408
  • [33] Average-Case Analysis for a Simple Compression Algorithm
    D. Merlini
    R. Sprugnoli
    M. C. Verri
    Algorithmica, 1998, 22 : 585 - 599
  • [34] AVERAGE-CASE ANALYSIS OF A HEURISTIC FOR THE ASSIGNMENT PROBLEM
    KARP, RM
    KAN, AHGR
    VOHRA, RV
    MATHEMATICS OF OPERATIONS RESEARCH, 1994, 19 (03) : 513 - 522
  • [35] Average-case analysis of approximate Trie search
    Maass, MG
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2004, 3109 : 472 - 483
  • [36] AN AVERAGE-CASE ANALYSIS OF MAT AND INVERTED FILE
    RAO, NSV
    IYENGAR, SS
    KASHYAP, RL
    THEORETICAL COMPUTER SCIENCE, 1988, 62 (03) : 251 - 266
  • [37] Average-Case Analysis of Dynamic Graph Algorithms
    D. Alberts
    M. R. Henzinger
    Algorithmica, 1998, 20 : 31 - 60
  • [38] Generating words lexicographically: An average-case analysis
    Rainer Kemp
    Acta Informatica, 1998, 35 : 17 - 89
  • [39] An Average-Case Analysis of the Reverse Factor Algorithm
    Chen, K. H.
    Huang, G. S.
    Lee, R. C. T.
    IMCIC 2010: INTERNATIONAL MULTI-CONFERENCE ON COMPLEXITY, INFORMATICS AND CYBERNETICS, VOL I (POST-CONFERENCE EDITION), 2010, : 284 - 289
  • [40] Average-Case Analysis of Perfect Sorting by Reversals
    Bouvel, Mathilde
    Chauve, Cedric
    Mishna, Marni
    Rossin, Dominique
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2009, 5577 : 314 - +