Items where Author is "Natura, Bento"

Article

Koh, Zhuan Khye, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2024) On circuit diameter bounds via circuit imbalances. Mathematical Programming, 206 (1-2). 631 - 662. ISSN 0025-5610

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2023) An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems. Mathematics of Operations Research, 48 (4). 1934 - 1958. ISSN 0364-765X

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

Book Section

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2024) A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. In: Mohar, Bojan, Shinkar, Igor and O�Donnell, Ryan, (eds.) STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC ’24), June 24–28. Proceedings of the Annual ACM Symposium on Theory of Computing. ACM Press, New York, NY, 1561 – 1572. ISBN 9798400703836

Natura, Bento, Neuwohner, Meike ORCID: 0000-0002-3664-3687 and Weltge, Stefan (2022) The Pareto cover problem. In: Chechik, Shiri, Navarro, Gonzalo, Rotenberg, Eva and Herman, Grzegorz, (eds.) Leibniz International Proceedings in Informatics, LIPIcs. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772471

Jiang, Shunhua, Natura, Bento and Weinstein, Omri (2022) A faster interior-point method for sum-of-squares optimization. In: Bojanczyk, Mikolaj, Merelli, Emanuela and Woodruff, David P., (eds.) 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772358

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento and Végh, László A A. ORCID: 0000-0003-1152-200X (2022) On circuit diameter bounds via circuit imbalances. In: Aardal, Karen and Sanità, Laura, (eds.) Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),13265. Springer Science and Business Media Deutschland GmbH, 140 - 153. ISBN 9783031069000

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2021) An accelerated Newton-dinkelbach method and its application to two variables per inequality systems. In: Mutzel, Petra, Pagh, Rasmus and Herman, Grzegorz, (eds.) 29th Annual European Symposium on Algorithms, ESA 2021. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772044

Dadush, Daniel, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2020) Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers. In: Proceedings of The 61st Annual Symposium on Foundations of Computer Science (FOCS 2020), November 16-19. IEEE Computer Society, pp. 931-942.

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