17 results on '"Dubey, Yatharth"'
Search Results
2. Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization
3. A Short Proof of Tight Bounds on the Smallest Support Size of Integer Solutions to Linear Equations
4. A Theoretical and Computational Analysis of Full Strong-Branching
5. On Polytopes with Linear Rank with respect to Generalizations of the Split Closure
6. Branch-and-bound solves random binary IPs in poly(n)-time
7. On polytopes with linear rank with respect to generalizations of the split closure
8. Lower Bounds on the Size of General Branch-and-Bound Trees
9. Lower bounds on the size of general branch-and-bound trees
10. Branch-and-Bound Solves Random Binary IPs in Polytime
11. The Power of The Hybrid Model for Mean Estimation
12. Branch-and-Bound Solves Random Binary IPs in Polytime
13. A theoretical and computational analysis of full strong-branching
14. On Polytopes with Linear Rank with Respect to Generalizations of the Split Closure
15. Branch-and-bound solves random binary IPs in poly(n)-time
16. Lower bounds on the size of general branch-and-bound trees
17. The Power of the Hybrid Model for Mean Estimation
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.