Loading Events
  • This event has passed.

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.