Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks

Teodros GetachewMichael KostrevaLaura Lancaster — 2010

RAIRO - Operations Research

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 if there are...

Page 1

Download Results (CSV)