Annual meeting of the SPP 1307 "Algorithm Engineering" 2009
Annual meeting of the SPP 1307 "Algorithm Engineering" 2009
The annual meeting 2009 of SPP 1307 will take place in Dortmund, June 2-3, directly before the 8th International Symposium on Experimental Algorithms
( SEA ), which will also take place at the Technische Universität Dortmund.
There will be an invited talk held by Robert E. Bixby (Rice University).
In addition the organizers of SEA invite all participants to join their welcome event on June 3.
Time
Tuesday, June 2: 8:30-18:00 (Dinner at 20:00)
Wednesday, June 3: 9:00-18:00
Wednesday, June 3: 18:00-20:00 SEA welcome reception
Location
Technische Universität Dortmund
Fakultät für Informatik
Lehrstuhl für Algorithm Engineering (Ls11)
Otto-Hahn-Straße 14
44227 Dortmund
The registration deadline is May 10. The registration fee is 45 €.
For registration, please send an e-mail to Hoi-Ming Wong (hoi-ming.wongtu-dortmund.de) until May 10.
In addition, let us know whether you want to give a talk or not.
If you want to give a talk then submit the title and a short abstract until May 28.
Please also notify us if you want vegetarian food.
Accommodation
Tryp Dortmund :
This hotel is near the university campus, 25 minutes walking distance away from Otto-Hahn-Straße 14.
Also you can take the bus line '462' from there to
Joseph-v.-Fraunhofer-Straße.
We have reserved a contingent of rooms until April 4. Please use the keyword "SPP2009" if you want to book rooms there.
NH Dortmund: This hotel is about 300 m away from
the main railway station.
Königshof: A hotel about 400 meter away from the main railway station. It
offers free WLAN access.
Mercure Hotel Dortmund: Another nice hotel about 400 meter away from main railway station. The lobby offers free WLAN access.
Note: From the main station you can use the S-Bahn "S1" to get to the university campus. The trip takes about 10 minutes.
Wednesday, June 3, 16:30 – 17:30
Invited Talk by Robert E. Bixby
Location: Otto-Hahn-Str. 14 room E23
Title: The Gurobi Solver
Abstract:
This talk will begin with a description of the solver design both in terms of
accessibility and the underlying algorithmic framework. This framework has been built to
provide maximum flexibility in exploiting current strategies for solving mixed-integer programs (MIP).
We will discuss our approaches for handling the key MIP issues in deterministic parallel, MIP search, cutting planes.
Finally, we will present computational results for the Gurobi MIP solver.
Sponsorship
The SPP1307 annual meeting 2009 is generously sponsored by: