A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks

DOI10.1051/RO:2000100MaRDI QIDQ4497884zbMATH OpenOpenAlexFDO

Authors 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/, https://eudml.org/doc/197846

zbMATH Keywords

dynamic networkdynamic programmingPareto optimizationshortest pathtime-dependent cost function

Mathematics Subject Classification ID

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

Recommendations

• Time dependency in multiple objective dynamic programming
• Optimal flows in dynamic networks and algorithms for their finding
• scientific article; zbMATH DE number 1858040
• scientific article; zbMATH DE number 1918689
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

Cited in

(8)

• Optimal building evacuation time considering evacuation routes
• 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
• A dual framework for time-variant network decision problems
• GENERALIZED PRINCIPLE OF OPTIMALITY IN PANSYSTEMS NETWORK ANALYSIS
• scientific article; zbMATH DE number 1858040 (Why is no real title available?)
• A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4497884)