STRONGLY POLYNOMIAL ALGORITHM FOR A CLASS OF COMBINATORIAL LCPS

被引:5
|
作者
CHANDRASEKARAN, R [1 ]
KABADI, SN [1 ]
机构
[1] UNIV NEW BRUNSWICK,FAC ADM,FREDERICTON E3B 5A3,NB,CANADA
关键词
D O I
10.1016/0167-6377(87)90036-8
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:91 / 92
页数:2
相关论文
共 50 条
  • [21] Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid
    Fonlupt, Jean
    Skoda, Alexandre
    RESEARCH TRENDS IN COMBINATORIAL OPTIMIZATION, 2009, : 69 - 85
  • [22] 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
  • [23] A polynomial combinatorial algorithm for generalized minimum cost flow
    Wayne, KD
    MATHEMATICS OF OPERATIONS RESEARCH, 2002, 27 (03) : 445 - 459
  • [24] An algorithm for training a class of polynomial models
    Popescu, Marius-Claudiu
    Grama, Lacrimioara
    Rusu, Corneliu
    DIGITAL SIGNAL PROCESSING, 2023, 141
  • [25] New strongly polynomial dual network simplex algorithm
    Armstrong, Ronald D.
    Jin, Zhiying
    Mathematical Programming, Series B, 1997, 78 (02): : 131 - 148
  • [26] A strongly polynomial algorithm for line search in submodular polyhedra
    Nagano, Kiyollito
    DISCRETE OPTIMIZATION, 2007, 4 (3-4) : 349 - 359
  • [27] A FASTER STRONGLY POLYNOMIAL MINIMUM COST FLOW ALGORITHM
    ORLIN, JB
    OPERATIONS RESEARCH, 1993, 41 (02) : 338 - 350
  • [28] An oracle strongly polynomial algorithm for bottleneck expansion problems
    Zhang, JZ
    Liu, ZH
    OPTIMIZATION METHODS & SOFTWARE, 2002, 17 (01): : 61 - 75
  • [29] A Strongly Polynomial Algorithm for Bimodular Integer Linear Programming
    Artmann, Stephan
    Weismantel, Robert
    Zenklusen, Rico
    STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 1206 - 1219
  • [30] A strongly polynomial algorithm for the minimum cost tension problem
    Hadjiat, M
    Maurras, JF
    DISCRETE MATHEMATICS, 1997, 165 : 377 - 394