A Strongly Polynomial Algorithm for Generalized Flow Maximization

被引：14
|
作者：
Vegh, Laszlo A. [1 ]
机构：
[1] London Sch Econ & Polit Sci, Dept Math, London WC2A 2AE, England
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 2017年 / 42卷 / 01期
关键词：
network flow algorithms; generalized flows; strongly polynomial algorithms; linear programming; MINIMUM-COST FLOW; CIRCULATION PROBLEM; LINEAR-PROGRAMS; COMBINATORIAL ALGORITHM; NETWORK; GAINS;
D O I：
10.1287/moor.2016.0800
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a new variant of the scaling technique called continuous scaling. The main measure of progress is that within a strongly polynomial number of steps, an arc can be identified that must be tight in every dual optimal solution and thus can be contracted. As a consequence of the result, we also obtain a strongly polynomial algorithm for the linear feasibility problem with at most two nonzero entries per column in the constraint matrix.
引用
收藏
页码：179 / 211
页数：33
相关论文
共 50 条
  • [21] A Strongly Polynomial Algorithm for Linear Exchange Markets
    Garg, Jugal
    Vegh, Laszlo A.
    PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 54 - 65
  • [22] Synergetically generalized expectation maximization algorithm for ECT
    Peter, J
    Smith, MF
    Scarfone, C
    Jaszczak, RJ
    Coleman, RE
    1997 IEEE NUCLEAR SCIENCE SYMPOSIUM - CONFERENCE RECORD, VOLS 1 & 2, 1998, : 1308 - 1312
  • [23] Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
    Vegh, Laszlo A.
    STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 27 - 39
  • [24] A STRONGLY POLYNOMIAL ALGORITHM FOR A CLASS OF MINIMUM-COST FLOW PROBLEMS WITH SEPARABLE CONVEX OBJECTIVES
    Vegh, Laszlo A.
    SIAM JOURNAL ON COMPUTING, 2016, 45 (05) : 1729 - 1761
  • [25] Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
    Illes, Tibor
    Molnar-Szipai, Richard
    DISCRETE APPLIED MATHEMATICS, 2016, 214 : 201 - 210
  • [26] Training for polynomial segment model using the expectation maximization algorithm
    Li, CF
    Siu, MH
    2004 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL I, PROCEEDINGS: SPEECH PROCESSING, 2004, : 841 - 844
  • [27] A strongly polynomial algorithm for line search in submodular polyhedra
    Nagano, Kiyollito
    DISCRETE OPTIMIZATION, 2007, 4 (3-4) : 349 - 359
  • [28] New strongly polynomial dual network simplex algorithm
    Armstrong, Ronald D.
    Jin, Zhiying
    Mathematical Programming, Series B, 1997, 78 (02): : 131 - 148
  • [29] Strongly polynomial algorithm for a class of linear programming problems
    Zhongshan Daxue Xuebao, 1 (06):
  • [30] An oracle strongly polynomial algorithm for bottleneck expansion problems
    Zhang, JZ
    Liu, ZH
    OPTIMIZATION METHODS & SOFTWARE, 2002, 17 (01): : 61 - 75
12345