Dadush, Daniel; Huiberts, Sophie; Natura, Bento; Végh, László A. A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. (English) Zbl 07807808 Math. Program. 204, No. 1-2 (A), 135-206 (2024). MSC: 90C05 90C51 PDFBibTeX XMLCite \textit{D. Dadush} et al., Math. Program. 204, No. 1--2 (A), 135--206 (2024; Zbl 07807808) Full Text: DOI OA License
Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A. An accelerated Newton-Dinkelbach method and its application to two variables per inequality systems. (English) Zbl 07811848 Math. Oper. Res. 48, No. 4, 1934-1958 (2023). MSC: 90C32 90C05 90C27 90C40 68W40 49M15 PDFBibTeX XMLCite \textit{D. Dadush} et al., Math. Oper. Res. 48, No. 4, 1934--1958 (2023; Zbl 07811848) Full Text: DOI
Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A. On circuit diameter bounds via circuit imbalances. (English) Zbl 1502.52013 Aardal, Karen (ed.) et al., Integer programming and combinatorial optimization. 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13265, 140-153 (2022). MSC: 52B05 90C05 90C10 52B11 90C35 PDFBibTeX XMLCite \textit{D. Dadush} et al., Lect. Notes Comput. Sci. 13265, 140--153 (2022; Zbl 1502.52013) Full Text: DOI arXiv
Allamigeon, Xavier; Dadush, Daniel; Loho, Georg; Natura, Bento; Végh, László A. Interior point methods are not worse than Simplex. arXiv:2206.08810 Preprint, arXiv:2206.08810 [math.OC] (2022). BibTeX Cite \textit{X. Allamigeon} et al., ``Interior point methods are not worse than Simplex'', Preprint, arXiv:2206.08810 [math.OC] (2022) Full Text: arXiv OA License
Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A. An accelerated Newton-Dinkelbach method and its application to two variables per inequality systems. (English) Zbl 07740891 Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 36, 15 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{D. Dadush} et al., LIPIcs -- Leibniz Int. Proc. Inform. 204, Article 36, 15 p. (2021; Zbl 07740891) Full Text: DOI arXiv
Dadush, Daniel; Huiberts, Sophie; Natura, Bento; Végh, László A. A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. (English) Zbl 07298286 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 761-774 (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Dadush} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 761--774 (2020; Zbl 07298286) Full Text: DOI arXiv Link
Dadush, Daniel; Végh, László A.; Zambelli, Giacomo Rescaling algorithms for linear conic feasibility. (English) Zbl 1455.90103 Math. Oper. Res. 45, No. 2, 732-754 (2020). MSC: 90C05 PDFBibTeX XMLCite \textit{D. Dadush} et al., Math. Oper. Res. 45, No. 2, 732--754 (2020; Zbl 1455.90103) Full Text: DOI arXiv Link
Dadush, Daniel; Natura, Bento; Végh, László A. Revisiting Tardos’s Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. arXiv:2009.04942 Preprint, arXiv:2009.04942 [math.OC] (2020). BibTeX Cite \textit{D. Dadush} et al., ``Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers'', Preprint, arXiv:2009.04942 [math.OC] (2020) Full Text: arXiv OA License
Dadush, Daniel; Végh, László A.; Zambelli, Giacomo Geometric rescaling algorithms for submodular function minimization. (English) Zbl 1403.68380 Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 832-848 (2018). MSC: 68W40 90C27 PDFBibTeX XMLCite \textit{D. Dadush} et al., in: Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7--10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 832--848 (2018; Zbl 1403.68380) Full Text: arXiv Link
Dadush, Daniel; Végh, László A.; Zambelli, Giacomo Rescaled coordinate descent methods for linear programming. (English) Zbl 1419.90063 Louveaux, Quentin (ed.) et al., Integer programming and combinatorial optimization. 18th international conference, IPCO 2016, Liège, Belgium, June 1–3, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9682, 26-37 (2016). MSC: 90C05 90C49 PDFBibTeX XMLCite \textit{D. Dadush} et al., Lect. Notes Comput. Sci. 9682, 26--37 (2016; Zbl 1419.90063) Full Text: DOI Link