![]() | Up a level |
Dadush, Daniel, Huiberts, Sophie, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X
(2023)
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.
Mathematical Programming.
ISSN 0025-5610
Dadush, Daniel, Huiberts, Sophie, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X
(2020)
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.
In: Makarychev, Konstantin, Makarychev, Yury, Tulsiani, Madhur, Kamath, Gautam and Chuzhoy, Julia, (eds.)
STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing.
Proceedings of the Annual ACM Symposium on Theory of Computing.
Association for Computing Machinery, USA, pp. 761-774.
ISBN 9781450369794