TOWARDS A GENUINELY POLYNOMIAL ALGORITHM FOR LINEAR-PROGRAMMING

[1] A POLYNOMIAL TIME ALGORITHM FOR SOLVING SYSTEMS OF LINEAR INEQUALITIES WITH 2 VARIABLES PER INEQUALITY [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (04) : 827 - 845

[2] CHAN T, 1977, TR77326 CORN U DEP C

[3] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &

[4] Khachian L. G., 1979, SOV MATH DOKL, V20, P191

[5] Megiddo N., 1979, Mathematics of Operations Research, V4, P414, DOI 10.1287/moor.4.4.414

[6] Megiddo N., 1981, 22nd Annual Symposium on Foundations of Computer Science, P399, DOI 10.1109/SFCS.1981.11

[7] MEGIDDO N, UNPUB THEORET COMP S

[8] NELSON CG, 1978, AIM319 STANF U DEP C

[9] PRATT V, 1977, UNPUB 2 EASY THEORIE

[10] DECIDING LINEAR INEQUALITIES BY COMPUTING LOOP RESIDUES [J]. JOURNAL OF THE ACM, 1981, 28 (04) : 769 - 779

[1] A POLYNOMIAL TIME ALGORITHM FOR SOLVING SYSTEMS OF LINEAR INEQUALITIES WITH 2 VARIABLES PER INEQUALITY [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (04) : 827 - 845

[2] CHAN T, 1977, TR77326 CORN U DEP C

[3] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &

[4] Khachian L. G., 1979, SOV MATH DOKL, V20, P191

[5] Megiddo N., 1979, Mathematics of Operations Research, V4, P414, DOI 10.1287/moor.4.4.414

[6] Megiddo N., 1981, 22nd Annual Symposium on Foundations of Computer Science, P399, DOI 10.1109/SFCS.1981.11

[7] MEGIDDO N, UNPUB THEORET COMP S

[8] NELSON CG, 1978, AIM319 STANF U DEP C

[9] PRATT V, 1977, UNPUB 2 EASY THEORIE

[10] DECIDING LINEAR INEQUALITIES BY COMPUTING LOOP RESIDUES [J]. JOURNAL OF THE ACM, 1981, 28 (04) : 769 - 779