Shortest paths in networks with vector weights (Q795755): Difference between revisions

For a directed network in which vector weights are assigned to arcs, the Pareto analog to the shortest path problem is analyzed. An algorithm is presented for obtaining all Pareto shortest paths from a specified node to every other node.

0 references

zbMATH Keywords

directed network

0 references

vector weights

0 references

Pareto shortest paths

0 references

describes a project that uses

Algorithm 97

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

0 references

0 references

An Appraisal of Some Shortest-Path Algorithms

0 references

Technical Note—Shortest-Path Algorithms: A Comparison

0 references

Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

0 references

A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$

0 references

On a routing problem

0 references

On the Shortest Route Through a Network

0 references

A note on two problems in connexion with graphs

0 references

Proper efficiency and the theory of vector maximization

0 references

Identifiers

zbMATH Open document ID

0542.90099

0 references

DOI

10.1007/BF00938761

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:795755

@@ Property / author @@
-I. Douglas Moon
@@ Property / author: I. Douglas Moon / rank @@
-Normal rank
@@ Property / author @@
+I. Douglas Moon
@@ Property / author: I. Douglas Moon / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 97
@@ Property / describes a project that uses: Algorithm 97 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770975
@@ Property / cites work: Q4770975 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5595961
@@ Property / cites work: Q5595961 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684699
@@ Property / cites work: Q5684699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3802859
@@ Property / cites work: Q3802859 / rank @@
+Normal rank
@@ Property / cites work @@
+An Appraisal of Some Shortest-Path Algorithms
@@ Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Shortest-Path Algorithms: A Comparison
+Normal rank
@@ Property / cites work @@
+Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
+Normal rank
@@ Property / cites work @@
+A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ *  n)$
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Shortest Route Through a Network
@@ Property / cites work: On the Shortest Route Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Proper efficiency and the theory of vector maximization
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:795755