Campus Event Calendar
Event Entry
What and Who
Branch and Cut for Finding Optimal Steiner Trees in the Plane
Ernst Althaus
SIG Meeting
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 9 April 99
11:00
60 Minutes
MPI
007
Saarbrücken
Abstract
I present exact algorithms for the Euclidean and rectilinear Steiner
tree problems in the plane. These algorithms, which are based on the
generation and concatenation of full Steiner trees, are much more
efficient than other approaches and allow exact solution of problem
instances with more than 2000 terminals.
Contact
Zeev Nutov
124
--email hidden
passcode not visible
logged in users only