Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 33, 1995 - Issue 1
Submit an article Journal homepage
15
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

A strongly polynomial algorithm for a new class of linear inequalitiesFootnote1

O. V. Gorokh Institute of Engineering Cybernetics of the Byelorussian Academy of Sciences, Surganov St. 6, Minsk, Belarus, 220012
&
F. Werner Fakultät für Mathematik, Otto-von-Guericke-Universität, PSF 4120, Madeburge, 39016, Germany
Pages 43-55 | Published online: 20 Mar 2007

References

  • Chernikov , S.N. 1968 . “ Science ” . In Linear inequalities Moscow (in Russian)
  • Gorokh , O.V. 1992 . Vestsi. Acad. Navuk Bel., Ser. Fiz-Mat. Navuk . On one method for solving linear inequality systems , 2 : 121 – 121 . (in Russian)
  • Khachian , L.G. 1987 . “ Mathematika, Kibernetika ” . In Complexity study of linear programming problems , Moscow : Znanie . in:Ser in Russian
  • Megiddo , N. 1983 . Towards a genuinely polynomial algorithm for linear programming, SIAM J. Comput , 12 ( 2 ) : 347 – 353 .
  • Megiddo , N. 1984 . Linear programming in linear time when the dimension is fixed, J. of the ACM , 31 ( 1 ) : 114 – 127 .
  • Papadimitriou , C.H. and Steiglitz , K. 1982 . Combinatorial optimization: Algorithms and Complexity , New Jersey : Englewood Cliffs .
  • Tardos E. A strongly polynomial algorithm to solve combinatorial linear problems Institute of Ökonometrie and Oper. Res., University of Bonn 1985 A Report 84360-OR
  • Tardos , E. 1985 . Combinatorica . A strongly polynomial minimum cost circulation algorithm , 5 ( 3 ) : 247 – 255 .
  • Vavasis , S.A. 1991 . Nonlinear Optimization, Complexity Issues , Oxford Science Publications .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.