MPI-INF Logo
Campus Event Calendar

Event Entry

New for: D1, D2

What and Who

The Constrained Shortest Path Problem

Mark Ziegelmann
Max-Planck-Institut für Informatik - AG 1
AG1 Advanced Mini-Course
AG 1, AG 2  
AG Audience
-- Not specified --

Date, Time and Location

Thursday, 12 August 99
13:30
-- Not specified --
MPI
024
Saarbrücken

Abstract

The constrained shortest path problem is to find the

shortest path in a graph that satisfies a given resource limit.
I will discuss several methods to solve the problem
and also give experimental results.

Contact

Mark Ziegelmann
--email hidden
passcode not visible
logged in users only