A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set

DOI10.1051/ro:2003001zbMath1062.90032OpenAlexW2105253573MaRDI QIDQ4809666

Teodros Getachew, Michael M. Kostreva

Publication date: 30 August 2004

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

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

zbMATH Keywords

dimension reductionmulti-criteria optimizationtime-variant networks

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10)

Cites Work

• A note on two problems in connexion with graphs
• Shortest paths in networks with vector weights
• Fuzzy dynamic programming: Main developments and applications
• Time dependency in multiple objective dynamic programming
• Dynamic programming in multiplicative lattices
• The shortest route through a network with time-dependent internodal transit times
• The concept of state in discrete dynamic programming
• On a routing problem
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets
• Note on Multiple Objective Dynamic Programming
• Shortest route with time dependent length of edges and limited delay possibilities in nodes
• A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
• An Appraisal of Some Shortest-Path Algorithms
• Decision-Making in a Fuzzy Environment

This page was built for publication: A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set