NEW BRANCH-AND-BOUND ALGORITHM FOR FIXED-CHARGE TRANSPORTATION PROBLEM

被引:63
作者
KENNINGTON, J
UNGER, E
机构
[1] SO METHODIST UNIV,DALLAS,TX 75222
[2] GEORGIA INST TECHNOL,ATLANTA,GA 30332
关键词
D O I
10.1287/mnsc.22.10.1116
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:1116 / 1126
页数:11
相关论文
共 33 条
[1]   AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES [J].
BALAS, E .
OPERATIONS RESEARCH, 1965, 13 (04) :517-&
[2]  
Balinski M, 1961, NAVAL RES LOG QUART, V8, P41
[3]  
BREU R, 1973, 44TH NAT M ORSA
[4]   AN APPROXIMATE SOLUTION METHOD FOR FIXED CHARGE PROBLEM [J].
COOPER, L ;
DREBES, C .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1967, 14 (01) :101-&
[5]  
COOPER L, 1968, COO14937 WASH U DEP
[6]  
CROWDER HP, 1973, MATH PROGRAM, P213
[7]   A TREE-SEARCH ALGORITHM FOR MIXED INTEGER PROGRAMMING-PROBLEMS [J].
DAKIN, RJ .
COMPUTER JOURNAL, 1965, 8 (03) :250-253
[8]  
DENZLER DR, 1969, NAV RES LOGIST Q, V16, P411
[9]  
FRANK RS, 1972, THESIS JOHNS HOPKINS
[10]  
Garfinkel R. S., 1972, INTEGER PROGRAMMING