Items where Author is "Natura, Bento"

Number of items: 11.
Article
  • An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems. (2023) Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A. picture_as_pdf
  • A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. (2023) Dadush, Daniel; Huiberts, Sophie; Natura, Bento; Végh, László A. picture_as_pdf
  • Interior point methods are not worse than simplex. Allamigeon, Xavier; Dadush, Daniel; Loho, Georg; Natura, Bento; Végh, László A. picture_as_pdf
  • On circuit diameter bounds via circuit imbalances. Koh, Zhuan Khye; Natura, Bento; Végh, László A. picture_as_pdf
    • Chapter
  • A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. (2024) Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Olver, Neil; Végh, László A. picture_as_pdf
  • A faster interior-point method for sum-of-squares optimization. (2022) Jiang, Shunhua; Natura, Bento; Weinstein, Omri picture_as_pdf
  • On circuit diameter bounds via circuit imbalances. Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A A.
  • The Pareto cover problem. Natura, Bento; Neuwohner, Meike; Weltge, Stefan picture_as_pdf
  • Revisiting Tardos's framework for linear programming:faster exact solutions using approximate solvers. Dadush, Daniel; Natura, Bento; Végh, László A. picture_as_pdf
  • An accelerated Newton-dinkelbach method and its application to two variables per inequality systems. Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A. picture_as_pdf
  • A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Dadush, Daniel; Huiberts, Sophie; Natura, Bento; Végh, László A. picture_as_pdf