This event has passed.

Deepak Rajan – Distributed-memory branch-and-bound tree search for stochastic Mixed-Integer Programs (MIPs)

Name: Deepak Rajan – Distributed-memory branch-and-bound tree search for stochastic Mixed-Integer Programs (MIPs)
Start: 2017-05-01T15:30:00-07:00
End: 2017-05-01T17:30:00-07:00

In this talk, I present and compare two frameworks for distributed-memory branch-and-bound (B&B) tree search.

Share this: