Yatharth Dubey

According to our database, Yatharth Dubey authored at least 10 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

A theoretical and computational analysis of full strong-branching.

Santanu S. Dey, Yatharth Dubey, Marco Molinaro, Prachi Shah

Math. Program., May, 2024

On polytopes with linear rank with respect to generalizations of the split closure.

Sanjeeb Dash, Yatharth Dubey

Discret. Optim., 2024

2023

Lower bounds on the size of general branch-and-bound trees.

Santanu S. Dey, Yatharth Dubey, Marco Molinaro

Math. Program., March, 2023

Branch-and-bound solves random binary IPs in poly(n)-time.

Santanu S. Dey, Yatharth Dubey, Marco Molinaro

Math. Program., 2023

Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization.

Gérard Cornuéjols, Yatharth Dubey

CoRR, 2023

2022

Novel Analysis of the Branch-and-Bound Method for Integer Programming.

Yatharth Dubey

PhD thesis, 2022

2021

Branch-and-Bound Solves Random Binary IPs in Polytime.

Santanu S. Dey, Yatharth Dubey, Marco Molinaro

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

The Power of the Hybrid Model for Mean Estimation.

Brendan Avent, Yatharth Dubey, Aleksandra Korolova

Proc. Priv. Enhancing Technol., 2020

Branch-and-Bound Solves Random Binary Packing IPs in Polytime.

Santanu S. Dey, Yatharth Dubey, Marco Molinaro

CoRR, 2020

2018

The Power of The Hybrid Model for Mean Estimation.

Yatharth Dubey, Aleksandra Korolova

CoRR, 2018