Displaying similar documents to “A generalization of dynamic programming for Pareto optimization in dynamic networks”

A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks

Teodros Getachew, Michael Kostreva, Laura Lancaster (2010)

RAIRO - Operations Research

Similarity:

The Algorithm in this paper is designed to find the shortest path in a network given time-dependent cost functions. It has the following features: it is recursive; it takes place bath in a backward dynamic programming phase and in a forward evaluation phase; it does not need a time-grid such as in Cook and Halsey and Kostreva and Wiecek's "Algorithm One”; it requires only boundedness (above and below) of the cost functions; it reduces to backward multi-objective dynamic programming...

The maximum capacity shortest path problem : generation of efficient solution sets

T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...