On a negative-equivalency theorem in associative optimal path problems (Q4500803): Difference between revisions

@@ 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.1080/02331930008844498
+Normal rank
@@ Property / OpenAlex ID @@
+W2149851707
@@ Property / OpenAlex ID: W2149851707 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algebra for Network Routing Problems
@@ Property / cites work: An Algebra for Network Routing Problems / 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 @@
+From dynamic programming to bynamic programming
@@ Property / cites work: From dynamic programming to bynamic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest and longest path problems
@@ Property / cites work: Shortest and longest path problems / rank @@
+Normal rank
@@ Property / cites work @@
+A new look at Bellman's principle of optimality
@@ Property / cites work: A new look at Bellman's principle of optimality / rank @@
+Normal rank