POLYNOMIAL DUAL NETWORK SIMPLEX ALGORITHMS

被引：26
|
作者：
ORLIN, JB
PLOTKIN, SA
TARDOS, E
机构：
[1] MIT,SLOAN SCH MANAGEMENT SCI,CAMBRIDGE,MA 02139
[2] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
[3] CORNELL UNIV,SCH OPERAT RES,ITHACA,NY 14853
来源：
MATHEMATICAL PROGRAMMING | 1993年 / 60卷 / 03期
关键词：
STRONGLY POLYNOMIAL; DUAL SIMPLEX ALGORITHM; NETWORK SIMPLEX ALGORITHM; MINIMUM COST NETWORK FLOWS;
D O I：
10.1007/BF01580615
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m2 log n) bound on the number of pivots, where n and m denotes the number of nodes and arcs in the input network. If the demands are integral and at most B, we also give an O(m(m+ n log n) min(log nB, m log n))-time implementation of a strategy that requires somewhat more pivots.
引用
收藏
页码：255 / 276
页数：22
相关论文
共 50 条
  • [1] On strongly polynomial dual simplex algorithms for the maximum flow problem
    Donald Goldfarb
    Wei Chen
    Mathematical Programming, 1997, 78 : 159 - 168
  • [2] On strongly polynomial dual simplex algorithms for the maximum flow problem
    Goldfarb, D
    Chen, W
    MATHEMATICAL PROGRAMMING, 1997, 78 (02) : 159 - 168
  • [3] A new strongly polynomial dual network simplex algorithm
    Ronald D. Armstrong
    Zhiying Jin
    Mathematical Programming, 1997, 78 : 131 - 148
  • [4] New strongly polynomial dual network simplex algorithm
    Armstrong, Ronald D.
    Jin, Zhiying
    Mathematical Programming, Series B, 1997, 78 (02): : 131 - 148
  • [5] A new strongly polynomial dual network simplex algorithm
    Armstrong, RD
    Jin, ZY
    MATHEMATICAL PROGRAMMING, 1997, 78 (02) : 131 - 148
  • [6] Polynomial-time primal simplex algorithms for the minimum cost network flow problem
    Goldfarb, Donald
    Hao, Jianxiu
    Algorithmica (New York), 1992, 8 (02): : 145 - 160
  • [7] POLYNOMIAL-TIME PRIMAL SIMPLEX ALGORITHMS FOR THE MINIMUM COST NETWORK FLOW PROBLEM
    GOLDFARB, D
    HAO, JX
    ALGORITHMICA, 1992, 8 (02) : 145 - 160
  • [8] A polynomial dual simplex algorithm for the generalized circulation problem
    Donald Goldfarb
    Zhiying Jin
    Yiqing Lin
    Mathematical Programming, 2002, 91 : 271 - 288
  • [9] A polynomial dual simplex algorithm for the generalized circulation problem
    Goldfarb, D
    Jin, ZY
    Lin, YQ
    MATHEMATICAL PROGRAMMING, 2002, 91 (02) : 271 - 288
  • [10] Towards Polynomial Simplex-Like Algorithms for Market Equilibria
    Garg, Jugal
    Mehta, Ruta
    Sohoni, Milind
    Vishnoi, Nisheeth K.
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1226 - 1242
12345