A STRONGLY POLYNOMIAL ALGORITHM TO SOLVE COMBINATORIAL LINEAR-PROGRAMS

被引：281

作者：

TARDOS, E

机构：

来源：

OPERATIONS RESEARCH | 1986年 / 34卷 / 02期

关键词：

D O I：

10.1287/opre.34.2.250

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：250 / 256

页数：7

共 10 条

[1] SYSTEMS OF DISTINCT REPRESENTATIVES AND LINEAR ALGEBRA [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04) :241-+

[2]

FRANK, 1985, UNPUB COMBINATORICA

[3]

FUJISHIGE S, 1985, 254853 U TSUK DISC P

[4] THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION [J].

GROTSCHEL, M ;

LOVASZ, L ;

SCHRIJVER, A .

COMBINATORICA, 1981, 1 (02) :169-197

[5]

GROTSCHEL M, ELLIPSOID METHOD COM

[6] A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].

KARMARKAR, N .

COMBINATORICA, 1984, 4 (04) :373-395

[7]

Khachiyan L.G., 1979, Sov. Math. Dokl., V20, P191

[8] FACTORING POLYNOMIALS WITH RATIONAL COEFFICIENTS [J].

LENSTRA, AK ;

LENSTRA, HW ;

LOVASZ, L .

MATHEMATISCHE ANNALEN, 1982, 261 (04) :515-534

[9] TOWARDS A GENUINELY POLYNOMIAL ALGORITHM FOR LINEAR-PROGRAMMING [J].

MEGIDDO, N .

SIAM JOURNAL ON COMPUTING, 1983, 12 (02) :347-353

[10] A STRONGLY POLYNOMIAL MINIMUM COST CIRCULATION ALGORITHM [J].

TARDOS, E .

COMBINATORICA, 1985, 5 (03) :247-255

← 1 →