Deepak Rajan – Distributed-memory branch-and-bound tree search for stochastic Mixed-Integer Programs (MIPs)
In this talk, I present and compare two frameworks for distributed-memory branch-and-bound (B&B) tree search.
Events
0 events found.
Latest Past Events
SoRL 2017 – Symposium on Robot Learning
The 2017 Symposium on Robot Learning (SoRL) is dedicated to the memory of Prof. Hubert Dreyfus who passed away on 22 April 2017 Watch a […]
Berkeley-Haas Africa Business Forum
Join us for the third edition of the Berkeley-Haas Africa Business Forum. This year the Forum will explore the dissemination of technology in Africa and its […]