Towards a Quantitative Theory of Integer Programming

Información del proyecto

QIP

Identificador del acuerdo de subvención: 805241

DOI

10.3030/805241

Proyecto cerrado

Fecha de la firma de la CE 10 Septiembre 2018

Fecha de inicio 1 Enero 2019

Fecha de finalización 31 Diciembre 2024

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 500 000,00

Aportación de la UE

€ 1 500 000,00

Coordinado por

STICHTING NEDERLANDSE WETENSCHAPPELIJK ONDERZOEK INSTITUTEN
Netherlands

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Book chapters (8)

On Circuit Diameter Bounds via Circuit Imbalances

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

On finding exact solutions of linear programs in the oracle model

Autores: Daniel Dadush, László A. Végh, Giacomo Zambelli
Publicado en: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Página(s) 2700-2722
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977073.106

Strongly Polynomial Frame Scaling to High Precision

Autores: Daniel Dadush, Akshay Ramachandran
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Página(s) 962-981
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.36

Optimizing Low Dimensional Functions over the Integers

Autores: Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae
Publicado en: Lecture Notes in Computer Science, Integer Programming and Combinatorial Optimization, 2023, Página(s) 115-126
Editor: Springer International Publishing
DOI: 10.1007/978-3-031-32726-1_9

On the Integrality Gap of Binary Integer Programs with Gaussian Data

Autores: Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
Publicado en: Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings, Edición 12707, 2021, Página(s) 427-442, ISBN 978-3-030-73878-5
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-73879-2_30

A Simple Method for Convex Optimization in the Oracle Model

Autores: Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
Publicado en: Lecture Notes in Computer Science, Integer Programming and Combinatorial Optimization, 2022, Página(s) 154-167
Editor: Springer International Publishing
DOI: 10.1007/978-3-031-06901-7_12

Smoothed Analysis of the Simplex Method

Autores: Daniel Dadush, Sophie Huiberts
Publicado en: Beyond the Worst-Case Analysis of Algorithms, 2022, Página(s) 309-333
Editor: Cambridge University Press
DOI: 10.1017/9781108637435.019

A Nearly Optimal Randomized Algorithm for Explorable Heap Selection

Autores: Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
Publicado en: Lecture Notes in Computer Science, Integer Programming and Combinatorial Optimization, 2023, Página(s) 29-43
Editor: 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

Autores: Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
Publicado en: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, Página(s) 1561-1572
Editor: ACM
DOI: 10.1145/3618260.3649764

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

Autores: Daniel Dadush, Zhuan Khye Koh, Bento Natura, and László A. Végh
Publicado en: Proceedings of the 29th Annual European Symposium on Algorithms (ESA 2021), 2021, Página(s) 1-15
Editor: 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

Autores: Daniel Dadush, Haotian Jiang, Victor Reis
Publicado en: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022
Editor: ACM
DOI: 10.1145/3519935.3519967

Interior point methods are not worse than Simplex

Autores: Xavier Allamigeon; Daniel Dadush; Georg Loho; Bento Natura; Laszlo A. Vegh
Publicado en: IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022
Editor: IEEE
DOI: 10.1109/focs54457.2022.00032

From Approximate to Exact Integer Programming

Autores: Dadush, Daniel; Eisenbrand, Friedrich; Rothvoss, Thomas
Publicado en: Integer Programming and Combinatorial Optimization, 2023
Editor: Springer
DOI: 10.1007/978-3-031-32726-1_8

On the complexity of branching proofs

Autores: Daniel Dadush, Samarth Tiwari
Publicado en: 35th Computational Complexity Conference (CCC 2020), 2020, Página(s) 1-35
Editor: "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

Autores: Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
Publicado en: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Página(s) 761-774, ISBN 9781-450369794
Editor: ACM
DOI: 10.1145/3357713.3384326

Integrality Gaps for Random Integer Programs via Discrepancy

Autores: Sander Borst, Daniel Dadush, Dan Mikulincer
Publicado en: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, Página(s) 1692-1733
Editor: 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

Autores: Daniel Dadush, Bento Natura, Laszlo A. Vegh
Publicado en: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Página(s) 931-942, ISBN 978-1-7281-9621-3
Editor: IEEE
DOI: 10.1109/focs46700.2020.00091

Interior point methods are not worse than Simplex

Autores: Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, Laszlo A. Vegh
Publicado en: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 267-277
Editor: IEEE
DOI: 10.1109/focs54457.2022.00032

Majorizing Measures for the Optimizer

Autores: Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha
Publicado en: 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021, Página(s) 20
Editor: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.itcs.2021.73

Majorizing measures for the optimizer

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

Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes

Autores: Bonnet, Gilles; Dadush, Daniel; Grupel, Uri; Huiberts, Sophie; Livshyts, Galyna
Publicado en: 38th International Symposium on Computational Geometry (SoCG 2022), 2022, Página(s) 1-15
Editor: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.socg.2022.18

Peer reviewed articles (11)

On the correlation gap of matroids

Autores: Edin Husić, Zhuan Khye Koh, Georg Loho, László A. Végh
Publicado en: Mathematical Programming, Edición 210, 2025, Página(s) 407-456, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-024-02116-w

Simple Iterative Methods for Linear Optimization over Convex Sets

Autores: Dadush, Daniel; Hojny, Christopher; Huiberts, Sophie; Weltge, Stefan
Publicado en: Mathematical Programming, 2023, ISSN 1436-4646
Editor: Springer
DOI: 10.1007/s10107-023-02005-8

A simple method for convex optimization in the oracle model

Autores: Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
Publicado en: Mathematical Programming, Edición 206, 2024, Página(s) 283-304, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-023-02005-8

On circuit diameter bounds via circuit imbalances

Autores: Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
Publicado en: Mathematical Programming, 2024, Página(s) 631-662, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-024-02107-x

From approximate to exact integer programming

Autores: Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
Publicado en: Mathematical Programming, Edición 210, 2025, Página(s) 223-241, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-024-02084-1

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

Autores: Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A.
Publicado en: Mathematics of Operations Research, 2022, ISSN 1526-5471
Editor: INFORMS
DOI: 10.48550/arxiv.2004.08634

On the integrality gap of binary integer programs with Gaussian data

Autores: Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
Publicado en: Mathematical Programming, Edición 197, 2023, Página(s) 1221-1263, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-022-01828-1

A nearly optimal randomized algorithm for explorable heap selection

Autores: Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
Publicado en: Mathematical Programming, Edición 210, 2025, Página(s) 75-96, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-024-02145-5

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

Autores: Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
Publicado en: Mathematics of Operations Research, 2022, ISSN 0364-765X
Editor: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2022.1326

Hidden Convexity, Optimization, and Algorithms on Rotation Matrices

Autores: Akshay Ramachandran, Kevin Shu, Alex L. Wang
Publicado en: Mathematics of Operations Research, 2024, ISSN 0364-765X
Editor: 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

Autores: Dadush, Daniel; Huiberts, Sophie; Natura, Bento, Végh, László A.
Publicado en: Mathematical Programming, 2023, ISSN 1436-4646
Editor: Springer
DOI: 10.1007/s10107-023-01956-2