THE MULTIPERIOD ASSIGNMENT PROBLEM - A MULTICOMMODITY NETWORK FLOW MODEL AND SPECIALIZED BRANCH AND BOUND ALGORITHM

被引:14
作者
ARONSON, JE
机构
[1] Southern Methodist Univ, Dep of, Operations Research &, Engineering Management, Dallas, TX,, Southern Methodist Univ, Dep of Operations Research & Engineering Management, Dallas, TX, USA
关键词
D O I
10.1016/0377-2217(86)90302-4
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
50
引用
收藏
页码:367 / 381
页数:15
相关论文
共 51 条
[1]  
[Anonymous], 1967, CORS J
[2]  
ARONSON JE, 1985, 83OR5 SO METH U DEP
[3]   TRAFFIC ASSIGNMENT IN COMMUNICATION SATELLITES [J].
BALAS, E ;
LANDWEER, PR .
OPERATIONS RESEARCH LETTERS, 1983, 2 (04) :141-147
[4]  
BALAS E, 1984, 158485 CARN U GRAD S
[5]   USE OF FICTITIOUS BOUNDS IN TREE SEARCH ALGORITHMS [J].
BAZARAA, MS ;
ELSHAFEI, AN .
MANAGEMENT SCIENCE, 1977, 23 (08) :904-908
[6]  
Bellman R., 1958, Q APPL MATH, V16, P87
[7]  
CHARNES A, 1969, MANAGE SCI B-APPL, V15, pB365
[8]  
CORBAN A, 1966, REV ROUMAINE MATH PU, V11, P57
[9]  
Corban A., 1964, REV ROUMAINE MATH PU, V9, P721
[10]  
Dantzig G. B., 1967, J COMPUTER SYSTEM SC, V1, P213, DOI [DOI 10.1016/S0022-0000%2867%2980015-1, 10.1016/S0022-0000%2867%2980015-1]