A two-criterion lexicographic algorithm for finding all shortest paths in networks (Q2263347): Difference between revisions

@@ 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 / full work available at URL @@
+https://doi.org/10.1007/s10559-014-9666-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2080217460
@@ Property / OpenAlex ID: W2080217460 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3888874
@@ Property / cites work: Q3888874 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
+Normal rank
@@ Property / cites work @@
+Multiple criteria optimization: State of the art annotated bibliographic surveys
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / 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