A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks

DOI10.1051/ro:2000100zbMath0963.90055OpenAlexW2036926277MaRDI QIDQ4497884

Teodros Getachew, Laura Lancaster, Michael M. Kostreva

Publication date: 24 August 2000

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2000__34_1_27_0/

zbMATH Keywords

dynamic programmingshortest pathdynamic networkPareto optimizationtime-dependent cost function

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Related Items (5)

A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set ⋮ Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach ⋮ Integrating Pareto optimization into dynamic programming ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ Optimal building evacuation time considering evacuation routes

This page was built for publication: A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks