ALGORITHM FOR 2-DIMENSIONAL CUTTING PROBLEMS

被引：315

作者：

CHRISTOFIDES, N ^{[1
]}

WHITLOCK, C ^{[1
]}

机构：

[1] IMPERIAL COLL,LONDON,ENGLAND

来源：

关键词：

D O I：

10.1287/opre.25.1.30

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：30 / 44

页数：15

共 13 条

[1] ART R, 1966, 3202006 IBM CAMBR SC
[2] A GRAPH-THEORETIC APPROACH TO A CLASS OF INTEGER-PROGRAMMING PROBLEMS
DESLER, JF
HAKIMI, SL
[J]. OPERATIONS RESEARCH, 1969, 17 (06) : 1017 - &
[3] LOADING PROBLEM
EILON, S
CHRISTOF.N
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 17 (05): : 259 - 268
[4] ESCUDERO LF, 1973, 8TH STANF U MATH PRO
[5] GHARE PM, 1968, 33RD NAT M OP RES SO
[6] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM
GILMORE, PC
GOMORY, RE
[J]. OPERATIONS RESEARCH, 1961, 9 (06) : 849 - 859
[7] MULTISTAGE CUTTING STOCK PROBLEMS OF 2 AND MORE DIMENSIONS
GILMORE, PC
GOMORY, RE
[J]. OPERATIONS RESEARCH, 1965, 13 (01) : 94 - &
[8] GILMORE PC, 1967, OPER RES, V15, P1045
[9] BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM
GREENBERG, H
HEGERICH, RL
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05): : 327 - 332
[10] HAHN S, 1967, 3202916 IBM NEW YORK