BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//Refresh Web Development//Helios Calendar//EN
X-FROM-URL:https://www.bayareascience.org/calendar/index.php?com=details&eID=20333
X-WR-RELCALID:BayAreaScience.org Distributed-memory branch-and-bound tree search for stochastic Mixed-Integer Programs (MIPs) 20170501T153000
X-WR-TIMEZONE:Europe/London
X-WR-CALNAME:BayAreaScience.org
BEGIN:VEVENT
URL;VALUE=URI:https://www.bayareascience.org/calendar/index.php?com=detail&eID=20333
DTSTART:20170501T153000
DTEND:20170501T153000
SUMMARY:Distributed-memory branch-and-bound tree search for stochastic Mixed-Integer Programs (MIPs)
DESCRIPTION:In this talk\, I present and compare two frameworks for distributed-memory branch-and-bound (B&B) tree search.Speaker: Deepak Rajan\n______________________________\nThis Event Downloaded From a Helios Calendar Powered Site
LOCATION:CITRIS at UC Berkeley - Sutardja Dai Hall Banatao Auditorium\, Berkeley\, CA  94720
CATEGORIES:BayAreaScience.org Events
PRIORITY:0
TRANSP:TRANSPARENT
END:VEVENT
END:VCALENDAR