BRANCH-AND-BOUND STRATEGIES FOR DYNAMIC-PROGRAMMING

被引：101

作者：

MORIN, TL

MARSTEN, RE

机构：

[1] PURDUE UNIV,W LAFAYETTE,IN 47907

[2] MIT,CAMBRIDGE,MA 02139

来源：

关键词：

D O I：

10.1287/opre.24.4.611

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：611 / 627

页数：17

共 45 条

[1] MERGING AND SORTING APPLIED TO ZERO-ONE KNAPSACK PROBLEM
AHRENS, JH
FINKE, G
[J]. OPERATIONS RESEARCH, 1975, 23 (06) : 1099 - 1109
[2] Baker K., 1974, INTRO SEQUENCING SCH
[3] Bellman R., 1957, DYNAMIC PROGRAMMING
[4] BELLMAN RE, 1970, MANAGE SCI B-APPL, V17, pB141
[5] TRAVELING SALESMAN PROBLEM - A SURVEY
BELLMORE, M
NEHAUSE.GL
[J]. OPERATIONS RESEARCH, 1968, 16 (03) : 538 - &
[6] Booth T. L., 1967, SEQUENTIAL MACHINES
[7] BOUNDS FOR TRAVELLING-SALESMAN PROBLEM
CHRISTOFIDES, N
[J]. OPERATIONS RESEARCH, 1972, 20 (05) : 1044 - +
[8] DENARDO EV, 1967, J IND ENGINEERING, V18, P106
[9] DHARMADHIKARI V, 1974, CP74009 SO METH U DE
[10] ELMAGHRABY SE, 1968, J IND ENGINEERING, V19, P105