Towards a Quantitative Theory of Integer Programming

Project Information

QIP

Grant agreement ID: 805241

DOI

10.3030/805241

Project closed

EC signature date 10 September 2018

Start date 1 January 2019

End date 31 December 2024

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 500 000,00

EU contribution

€ 1 500 000,00

Coordinated by

STICHTING NEDERLANDSE WETENSCHAPPELIJK ONDERZOEK INSTITUTEN
Netherlands

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Book chapters (8)

On Circuit Diameter Bounds via Circuit Imbalances

Author(s): Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
Published in: Lecture Notes in Computer Science, Integer Programming and Combinatorial Optimization, 2022, Page(s) 140-153
Publisher: Springer International Publishing
DOI: 10.1007/978-3-031-06901-7_11

On finding exact solutions of linear programs in the oracle model

Author(s): Daniel Dadush, László A. Végh, Giacomo Zambelli
Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Page(s) 2700-2722
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977073.106

Strongly Polynomial Frame Scaling to High Precision

Author(s): Daniel Dadush, Akshay Ramachandran
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 962-981
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.36

Optimizing Low Dimensional Functions over the Integers

Author(s): Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae
Published in: Lecture Notes in Computer Science, Integer Programming and Combinatorial Optimization, 2023, Page(s) 115-126
Publisher: Springer International Publishing
DOI: 10.1007/978-3-031-32726-1_9

On the Integrality Gap of Binary Integer Programs with Gaussian Data

Author(s): Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
Published in: Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings, Issue 12707, 2021, Page(s) 427-442, ISBN 978-3-030-73878-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-73879-2_30

A Simple Method for Convex Optimization in the Oracle Model

Author(s): Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
Published in: Lecture Notes in Computer Science, Integer Programming and Combinatorial Optimization, 2022, Page(s) 154-167
Publisher: Springer International Publishing
DOI: 10.1007/978-3-031-06901-7_12

Smoothed Analysis of the Simplex Method

Author(s): Daniel Dadush, Sophie Huiberts
Published in: Beyond the Worst-Case Analysis of Algorithms, 2022, Page(s) 309-333
Publisher: Cambridge University Press
DOI: 10.1017/9781108637435.019

A Nearly Optimal Randomized Algorithm for Explorable Heap Selection

Author(s): Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
Published in: Lecture Notes in Computer Science, Integer Programming and Combinatorial Optimization, 2023, Page(s) 29-43
Publisher: Springer International Publishing
DOI: 10.1007/978-3-031-32726-1_3

Conference proceedings (13)

A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column

Author(s): Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
Published in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, Page(s) 1561-1572
Publisher: ACM
DOI: 10.1145/3618260.3649764

An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems

Author(s): Daniel Dadush, Zhuan Khye Koh, Bento Natura, and László A. Végh
Published in: Proceedings of the 29th Annual European Symposium on Algorithms (ESA 2021), 2021, Page(s) 1-15
Publisher: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.esa.2021.36

A new framework for matrix discrepancy: partial coloring bounds via mirror descent

Author(s): Daniel Dadush, Haotian Jiang, Victor Reis
Published in: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022
Publisher: ACM
DOI: 10.1145/3519935.3519967

Interior point methods are not worse than Simplex

Author(s): Xavier Allamigeon; Daniel Dadush; Georg Loho; Bento Natura; Laszlo A. Vegh
Published in: IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022
Publisher: IEEE
DOI: 10.1109/focs54457.2022.00032

From Approximate to Exact Integer Programming

Author(s): Dadush, Daniel; Eisenbrand, Friedrich; Rothvoss, Thomas
Published in: Integer Programming and Combinatorial Optimization, 2023
Publisher: Springer
DOI: 10.1007/978-3-031-32726-1_8

On the complexity of branching proofs

Author(s): Daniel Dadush, Samarth Tiwari
Published in: 35th Computational Complexity Conference (CCC 2020), 2020, Page(s) 1-35
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.ccc.2020.34

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Author(s): Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Page(s) 761-774, ISBN 9781-450369794
Publisher: ACM
DOI: 10.1145/3357713.3384326

Integrality Gaps for Random Integer Programs via Discrepancy

Author(s): Sander Borst, Daniel Dadush, Dan Mikulincer
Published in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, Page(s) 1692-1733
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch65

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers

Author(s): Daniel Dadush, Bento Natura, Laszlo A. Vegh
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 931-942, ISBN 978-1-7281-9621-3
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00091

Interior point methods are not worse than Simplex

Author(s): Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, Laszlo A. Vegh
Published in: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 267-277
Publisher: IEEE
DOI: 10.1109/focs54457.2022.00032

Majorizing Measures for the Optimizer

Author(s): Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha
Published in: 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021, Page(s) 20
Publisher: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.itcs.2021.73

Majorizing measures for the optimizer

Author(s): Borst, Sander; Dadush, Daniel; Olver, Neil; Sinha, Makrand
Published in: Proceedings of the 13th Conference on Innovations in Theoretical Computer Science (ITCS), 2021
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itcs.2021.73

Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes

Author(s): Bonnet, Gilles; Dadush, Daniel; Grupel, Uri; Huiberts, Sophie; Livshyts, Galyna
Published in: 38th International Symposium on Computational Geometry (SoCG 2022), 2022, Page(s) 1-15
Publisher: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.socg.2022.18

Peer reviewed articles (11)

On the correlation gap of matroids

Author(s): Edin Husić, Zhuan Khye Koh, Georg Loho, László A. Végh
Published in: Mathematical Programming, Issue 210, 2025, Page(s) 407-456, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-024-02116-w

Simple Iterative Methods for Linear Optimization over Convex Sets

Author(s): Dadush, Daniel; Hojny, Christopher; Huiberts, Sophie; Weltge, Stefan
Published in: Mathematical Programming, 2023, ISSN 1436-4646
Publisher: Springer
DOI: 10.1007/s10107-023-02005-8

A simple method for convex optimization in the oracle model

Author(s): Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
Published in: Mathematical Programming, Issue 206, 2024, Page(s) 283-304, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-023-02005-8

On circuit diameter bounds via circuit imbalances

Author(s): Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
Published in: Mathematical Programming, 2024, Page(s) 631-662, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-024-02107-x

From approximate to exact integer programming

Author(s): Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
Published in: Mathematical Programming, Issue 210, 2025, Page(s) 223-241, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-024-02084-1

An Accelerated Newton-Dinkelbach Method and its Application to Two Variables Per Inequality Systems

Author(s): Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A.
Published in: Mathematics of Operations Research, 2022, ISSN 1526-5471
Publisher: INFORMS
DOI: 10.48550/arxiv.2004.08634

On the integrality gap of binary integer programs with Gaussian data

Author(s): Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
Published in: Mathematical Programming, Issue 197, 2023, Page(s) 1221-1263, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-022-01828-1

A nearly optimal randomized algorithm for explorable heap selection

Author(s): Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
Published in: Mathematical Programming, Issue 210, 2025, Page(s) 75-96, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-024-02145-5

An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems

Author(s): Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
Published in: Mathematics of Operations Research, 2022, ISSN 0364-765X
Publisher: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2022.1326

Hidden Convexity, Optimization, and Algorithms on Rotation Matrices

Author(s): Akshay Ramachandran, Kevin Shu, Alex L. Wang
Published in: Mathematics of Operations Research, 2024, ISSN 0364-765X
Publisher: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2023.0114

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Author(s): Dadush, Daniel; Huiberts, Sophie; Natura, Bento, Végh, László A.
Published in: Mathematical Programming, 2023, ISSN 1436-4646
Publisher: Springer
DOI: 10.1007/s10107-023-01956-2