UPPERBOUND ALGORITHEM FOR SINGLE AND MULTIPLE TERMINAL DELIVERY PROBLEM

被引：47

作者：

TILLMAN, FA

CAIN, TM

机构：

[1] ELECTR DATA SYST,DES MOINES,IA 50300

[2] KANSAS STATE UNIV,DEPT IND ENGN,MANHATTAN,KS 66502

来源：

MANAGEMENT SCIENCE SERIES A-THEORY | 1972年 / 18卷 / 11期

关键词：

D O I：

10.1287/mnsc.18.11.664

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：664 / 682

页数：19

共 26 条

[1] ON INTEGER-PROGRAM FOR DELIVERY PROBLEM
BALINSKI, ML
QUANDT, RE
[J]. OPERATIONS RESEARCH, 1964, 12 (02) : 300 - &
[2] GRAPHIC SOLUTION OF THE TRAVELING-SALESMAN PROBLEM
BARACHET, LL
[J]. OPERATIONS RESEARCH, 1957, 5 (06) : 841 - 845
[3] Bellman R., 1958, Q APPL MATH, V16, P87
[4] BRAUN W, THESIS KANSAS STATE
[5] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS
CLARKE, G
WRIGHT, JW
[J]. OPERATIONS RESEARCH, 1964, 12 (04) : 568 - &
[6] COCHRAN H, 1966, THESIS KANSAS STATE
[7] DANZIG GB, 1959, MANAGE SCI, V6, P80
[8] DANZIG GB, 1959, OPERATIONS RESEARCH, V7, P58
[9] Danztig G., 1954, OPER RES, V2, P393
[10] THE TRAVELING-SALESMAN PROBLEM
FLOOD, MM
[J]. OPERATIONS RESEARCH, 1956, 4 (01) : 61 - 75