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 条

[1] Some LCPs solvable in strongly polynomial time with Lemke's algorithm
Adler, Ilan
Cottle, Richard W.
Pang, Jong-Shi
MATHEMATICAL PROGRAMMING, 2016, 160 (1-2) : 477 - 493
[2] Some LCPs solvable in strongly polynomial time with Lemke’s algorithm
Ilan Adler
Richard W. Cottle
Jong-Shi Pang
Mathematical Programming, 2016, 160 : 477 - 493
[3] A combinatorial strongly polynomial algorithm for minimizing submodular functions
Iwata, S
Fleischer, L
Fujishige, S
JOURNAL OF THE ACM, 2001, 48 (04) : 761 - 777
[4] A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Schrijver, A
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2000, 80 (02) : 346 - 355
[5] A STRONGLY POLYNOMIAL ALGORITHM TO SOLVE COMBINATORIAL LINEAR-PROGRAMS
TARDOS, E
OPERATIONS RESEARCH, 1986, 34 (02) : 250 - 256
[6] Strongly polynomial algorithm for a class of linear programming problems
Zhongshan Daxue Xuebao, 1 (06):
[7] A STRONGLY POLYNOMIAL ALGORITHM FOR A SPECIAL-CLASS OF LINEAR-PROGRAMS
ADLER, I
COSARES, S
OPERATIONS RESEARCH, 1991, 39 (06) : 955 - 960
[8] A STRONGLY POLYNOMIAL ALGORITHM FOR THE TRANSPORTATION PROBLEM
KLEINSCHMIDT, P
SCHANNATH, H
MATHEMATICAL PROGRAMMING, 1995, 68 (01) : 1 - 13
[9] A Strongly Polynomial Algorithm for Controlled Queues
Zadorojniy, Alexander
Even, Guy
Shwartz, Adam
MATHEMATICS OF OPERATIONS RESEARCH, 2009, 34 (04) : 992 - 1007
[10] Strongly Polynomial and Fully Combinatorial Algorithms for Bisubmodular Function Minimization
McCormick, S. Thomas
Fujishige, Satoru
PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 44 - +

← 1 2 3 4 5 →