A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS

被引：752

作者：

HELD, M

KARP, RM

机构：

来源：

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS | 1962年 / 10卷 / 01期

关键词：

D O I：

10.1137/0110015

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：196 / 210

页数：15

共 13 条

[1]

ACKOFF RL, 1961, PROGR OPERATIONS RES, V1

[2]

[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393

[3] DYNAMIC PROGRAMMING TREATMENT OF TRAVELLING SALESMAN PROBLEM [J].

BELLMAN, R .

JOURNAL OF THE ACM, 1962, 9 (01) :61-&

[4]

BELLMAN R, 1960, 10TH P S APPL MATH A

[5] A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS [J].

CROES, GA .

OPERATIONS RESEARCH, 1958, 6 (06) :791-812

[6] ON A LINEAR-PROGRAMMING, COMBINATORIAL APPROACH TO THE TRAVELING-SALESMAN PROBLEM [J].

DANTZIG, GB ;

FULKERSON, DR ;

JOHNSON, SM .

OPERATIONS RESEARCH, 1959, 7 (01) :58-66

[7] THE TRIM PROBLEM [J].

EISEMANN, K .

MANAGEMENT SCIENCE, 1957, 3 (03) :279-284

[8] THE TRAVELING-SALESMAN PROBLEM [J].

FLOOD, MM .

OPERATIONS RESEARCH, 1956, 4 (01) :61-75

[9] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM [J].

GILMORE, PC ;

GOMORY, RE .

OPERATIONS RESEARCH, 1961, 9 (06) :849-859

[10]

KRAITCHIK M, 1953, MATH RECREATIONS, pCH11

← 1 2 →