Shortest paths in networks with vector weights
From MaRDI portal
Publication:795755
DOI10.1007/BF00938761zbMath0542.90099MaRDI QIDQ795755
Publication date: 1985
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C31: Sensitivity, stability, parametric optimization
Related Items
New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems, Unnamed Item, A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set, Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms, Routing with nonlinear multiattribute cost functions, Efficient spanning trees, An organizing principle for dynamic estimation, A multicriteria Pareto-optimal path algorithm, Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite, Multiobjective routing problems, Modified algorithm to compute Pareto-optimal vectors, Multiobjective transportation network design and routing problems: Taxonomy and annotation, Multiobjective routing of hazardous materials in stochastic networks, Algorithms for time-dependent bicriteria shortest path problems, New algorithms for multi objective shortest path problem., Multicriteria adaptive paths in stochastic, time-varying networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Proper efficiency and the theory of vector maximization
- On the Shortest Route Through a Network
- On a routing problem
- A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
- Technical Note—Shortest-Path Algorithms: A Comparison
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- An Appraisal of Some Shortest-Path Algorithms
