Towards a Genuinely Polynomial Algorithm for Linear Programming

Publisher Website

1 May 1983

journal article
Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing

Vol. 12 (2), 347-353
https://doi.org/10.1137/0212022

Abstract

No abstract available

All Related Versions

Version 1, RePEc (Unconfirmed version)

This publication has 6 references indexed in Scilit:

Is binary encoding appropriate for the problem-language relationship?
Theoretical Computer Science, 1982
Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM, 1981
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality
SIAM Journal on Computing, 1980
Combinatorial Optimization with Rational Objective Functions
Mathematics of Operations Research, 1979
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM, 1972
Linear Programming and Extensions
Published by Walter de Gruyter GmbH ,1963

Cited by 62 articles