Campus Event Calendar
Event Entry
What and Who
The Constrained Shortest Path Problem
Mark Ziegelmann
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Seminar des Graduiertenkollegs
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 7 December 98
16:00
-- Not specified --
45
015
Saarbrücken
Abstract
Consider a directed network where each edge is associated a nonnegative length
and a nonnegative resource value. In the constrained shortest path problem
(CSP) we want to determine the shortst path satisfying a given resource limit.
CSP has numerous applications in operations research.
We will present two algorithms to solve this problem: One based on dynamic
programming and the other based on a relaxation of the corresponding ILP.
We also report some experimental results.
Contact
Ülkü Coruh
0681/9325-526
--email hidden
passcode not visible
logged in users only