» » »

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.

Speaker: Deepak Rajan

Monday, 05/01/17

Contact:

Website: Click to Visit

Cost:

Free

Save this Event:

iCalendar
Google Calendar
Yahoo! Calendar
Windows Live Calendar

CITRIS at UC Berkeley

Sutardja Dai Hall
Banatao Auditorium
 Berkeley, CA 94720

Website: Click to Visit