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)
Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31)
Related Items (28)
Generalized zeon algebras: theory and application to multi-constrained path problems ⋮ Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ Multiobjective routing of hazardous materials in stochastic networks ⋮ Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications ⋮ 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 ⋮ An organizing principle for dynamic estimation ⋮ Multiobjective routing problems ⋮ The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks ⋮ The smoothed number of Pareto-optimal solutions in bicriteria integer optimization ⋮ The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization ⋮ Modified algorithm to compute Pareto-optimal vectors ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network ⋮ A multicriteria Pareto-optimal path algorithm ⋮ Routing with nonlinear multiattribute cost functions ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems ⋮ New algorithms for multi objective shortest path problem. ⋮ Improved smoothed analysis of multiobjective optimization ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions ⋮ Efficient spanning trees ⋮ Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
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
This page was built for publication: Shortest paths in networks with vector weights
