A POLYNOMIAL ALGORITHM FOR MINIMUM QUADRATIC COST FLOW PROBLEMS

被引:36
作者
MINOUX, M
机构
[1] CNET, Applied Mathematics Dep, Issy,, Fr, CNET, Applied Mathematics Dep, Issy, Fr
关键词
D O I
10.1016/0377-2217(84)90160-7
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
34
引用
收藏
页码:377 / 387
页数:11
相关论文
共 34 条
[1]   ESTIMATING NONNEGATIVE MATRICES FROM MARGINAL DATA [J].
BACHARACH, M .
INTERNATIONAL ECONOMIC REVIEW, 1965, 6 (03) :294-310
[2]   MINIMUM NORM PROBLEMS OVER TRANSPORTATION POLYTOPES [J].
BACHEM, A ;
KORTE, B .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1980, 31 (JUN) :103-118
[3]  
BIHAIN A, 1980, UNPUB NOV WORKSH LIN
[4]   THE ELLIPSOID METHOD - A SURVEY [J].
BLAND, RG ;
GOLDFARB, D ;
TODD, MJ .
OPERATIONS RESEARCH, 1981, 29 (06) :1039-1091
[5]   OPTIMAL ROUTING IN A PACKET-SWITCHED COMPUTER NETWORK [J].
CANTOR, DG ;
GERLA, M .
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (10) :1062-1069
[6]  
COTTLE RW, 1980, SOL8017 STANF U DEP
[7]  
DEBIESSE JL, 1980, ANN TELECOMMUN, V35, P91
[8]  
DEMBO RS, 1978, 21 YAL U SCH BUS TEC
[9]   THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].
EDMONDS, J ;
KARP, RM .
JOURNAL OF THE ACM, 1972, 19 (02) :248-&
[10]  
FERLAND JA, 1974, TRANSPORTATION SCI, V8, P335