Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Large Scale Optimization Problems I/III: Approaches for Large Scale Optimization Problems
Speaker:Tobias Polzin
coming from:Max-Planck-Institut für Informatik - AG 1
Speakers Bio:
Event Type:AG1 Advanced Mini-Course
Visibility:D1, D2, D3, D4
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Tuesday, 4 February 2003
Time:14:15
Duration:75 Minutes
Location:Saarbrücken
Building:46.1 - MPII
Room:024
Abstract
For some well-known combinatorial optimization problems

(for example the Traveling Salesman Problem or the Steiner
tree problem) recent developments made it possible
to find the exact solution of problem instances with ten thousand
vertices and more.
We give an overview on some approaches for large problems
(e.g., preprocessing techniques, fast upper and lower bound
computation, partitioning).
We will demonstrate the impact of these techniques on the Steiner tree
problem in networks.

Contact
Name(s):Tobias Polzin
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):