Shortest paths in networks with vector weights
From MaRDI portal
Publication:795755
DOI10.1007/BF00938761zbMATH Open0542.90099MaRDI QIDQ795755FDOQ795755
Authors: H. W. Corley, I. Douglas Moon 
Publication date: 1985
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
- Approximate shortest paths in weighted graphs
- scientific article; zbMATH DE number 1340882
- Shortest paths in random weighted graphs
- Shortest path network problems with stochastic arc weights
- scientific article; zbMATH DE number 1182917
- Shortest path problem on a network with imprecise edge weight
- Dijkstra's shortest-path algorithm in a network with variable weight matrices
- On Shortest Paths in Graphs with Random Weights
- Shortest-Path Routing in Arbitrary Networks
- Shortest paths with ordinal weights
Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- A note on two problems in connexion with graphs
- On a routing problem
- Proper efficiency and the theory of vector maximization
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Appraisal of Some Shortest-Path Algorithms
- Technical Note—Shortest-Path Algorithms: A Comparison
- On the shortest route through a network
- Title not available (Why is that?)
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- Title not available (Why is that?)
- A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
- Title not available (Why is that?)
Cited In (37)
- Shortest Paths with Bundles and Non-additive Weights Is Hard
- The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
- Generalized zeon algebras: theory and application to multi-constrained path problems
- Routing with nonlinear multiattribute cost functions
- Shortest paths with ordinal weights
- Application of the direct generalisation of scalar algorithms in vector optimisation on graphs
- A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
- A relation of dominance for the bicriterion bus routing problem
- The smoothed number of Pareto-optimal solutions in non-integer bicriteria optimization
- Title not available (Why is that?)
- New algorithms for multi objective shortest path problem.
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- Title not available (Why is that?)
- New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
- Title not available (Why is that?)
- The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
- A comparison of solution strategies for biobjective shortest path problems
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- A multicriteria Pareto-optimal path algorithm
- The tricriterion shortest path problem with at least two bottleneck objective functions
- Title not available (Why is that?)
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- Multiobjective routing of hazardous materials in stochastic networks
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- Multiobjective routing problems
- Title not available (Why is that?)
- UNLEASHING THE VERMIN (VECTORED ROUTE-LENGTH MINIMIZATION)
- A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network
- Algorithms for time-dependent bicriteria shortest path problems
- Improved smoothed analysis of multiobjective optimization
- Modified algorithm to compute Pareto-optimal vectors
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Title not available (Why is that?)
- Multicriteria adaptive paths in stochastic, time-varying networks
- An organizing principle for dynamic estimation
- Efficient spanning trees
Uses Software
This page was built for publication: Shortest paths in networks with vector weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795755)
