Minimum cost path problems with relays (Q709122): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2010.04.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2055093681
@@ Property / OpenAlex ID: W2055093681 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Theory of Dynamic Programming
@@ Property / cites work: On the Theory of Dynamic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+An empirical investigation of some bicriterion shortest path algorithms
+Normal rank
@@ Property / cites work @@
+The network design problem with relays
@@ Property / cites work: The network design problem with relays / rank @@
+Normal rank
@@ Property / cites work @@
+Wide area telecommunication network design: application to the Alberta SuperNet
+Normal rank
@@ Property / cites work @@
+The Black and White Traveling Salesman Problem
@@ Property / cites work: The Black and White Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Label correcting methods to solve multicriteria shortest path problems
+Normal rank
@@ Property / cites work @@
+Q3888874
@@ Property / cites work: Q3888874 / rank @@
+Normal rank
@@ Property / cites work @@
+On a multicriteria shortest path problem
@@ Property / cites work: On a multicriteria shortest path problem / rank @@
+Normal rank
@@ Property / cites work @@
+A label correcting approach for solving bicriterion shortest-path problems
+Normal rank