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

来源：

OPERATIONS RESEARCH LETTERS | 1987年 / 6卷 / 02期

关键词：

D O I：

10.1016/0167-6377(87)90036-8

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：91 / 92

页数：2

共 50 条

[31] Strongly polynomial simplex algorithm for bipartite vertex packing
Armstrong, RD
Jin, ZY
DISCRETE APPLIED MATHEMATICS, 1996, 64 (02) : 97 - 103
[32] A new strongly polynomial dual network simplex algorithm
Ronald D. Armstrong
Zhiying Jin
Mathematical Programming, 1997, 78 : 131 - 148
[33] A strongly polynomial algorithm for the inverse shortest arborescence problem
Hu, ZQ
Liu, ZH
DISCRETE APPLIED MATHEMATICS, 1998, 82 (1-3) : 135 - 154
[34] A new strongly polynomial dual network simplex algorithm
Armstrong, RD
Jin, ZY
MATHEMATICAL PROGRAMMING, 1997, 78 (02) : 131 - 148
[35] Strongly polynomial-time approximation for a class of bicriteria problems
Levin, A
OPERATIONS RESEARCH LETTERS, 2004, 32 (06) : 530 - 534
[36] A combinatorial polynomial algorithm for the linear Arrow-Debreu market
Duan, Ran
Mehlhorn, Kurt
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 7965 LNCS (PART 1): : 425 - 436
[37] A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
Duan, Ran
Mehlhorn, Kurt
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 425 - 436
[38] A combinatorial polynomial algorithm for the linear Arrow-Debreu market
Duan, Ran
Mehlhorn, Kurt
INFORMATION AND COMPUTATION, 2015, 243 : 112 - 132
[39] The value iteration algorithm is not strongly polynomial for discounted dynamic programming
Feinberg, Eugene A.
Huang, Jefferson
OPERATIONS RESEARCH LETTERS, 2014, 42 (02) : 130 - 131
[40] Strongly Polynomial Algorithm for Solving the General Problem of Least Modules
Mironov, V. V.
NUMERICAL ANALYSIS AND APPLICATIONS, 2010, 3 (02) : 133 - 150

← 1 2 3 4 5 →