BASIC DUAL FEASIBLE SOLUTIONS FOR A CLASS OF GENERALIZED NETWORKS

被引：11
作者：
GLOVER, F
KLINGMAN, D
NAPIER, A
机构：
来源：
OPERATIONS RESEARCH | 1972年 / 20卷 / 01期
关键词：
D O I：
10.1287/opre.20.1.126
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：126 / &
相关论文
共 25 条
[1]   ON THE GENERALIZED TRANSPORTATION PROBLEM [J].
BALAS, E ;
IVANESCU, PL .
MANAGEMENT SCIENCE, 1964, 11 (01) :188-202
[2]  
Balas E., 1962, CAHIERS CENTRE ETUDE, V4, P131
[3]  
BALAS E, 1962, CAHIERS CTR RECHERCH, V4, P98
[4]  
Balas E., 1966, MANAGE SCI, V12, P555, DOI DOI 10.1287/MNSC.12.7.555
[5]  
BARR RS, 1968, AMM13 U TEX GRAD SCH
[6]  
Bellman R., 1958, Q APPL MATH, V16, P87
[7]   THE STEPPING STONE METHOD OF EXPLAINING LINEAR PROGRAMMING CALCULATIONS IN TRANSPORTATION PROBLEMS [J].
Charnes, A. ;
Cooper, W. W. .
MANAGEMENT SCIENCE, 1954, 1 (01) :49-69
[8]   1-PASS ALGORITHMS FOR SOME GENERALIZED NETWORK PROBLEMS [J].
CHARNES, A ;
RAIKE, WM .
OPERATIONS RESEARCH, 1966, 14 (05) :914-&
[9]  
CHARNES A, 1964, CAHIERS CTR RECHERCH, V6, P5
[10]  
CHARNES A, 1961, MANAGEMENT MODELS IN, V1
123