Computing shortest paths in networks derived from recurrence relations (Q1179746): Difference between revisions

@@ Property / author @@
+Eugene L. Lawler
@@ Property / author: Eugene L. Lawler / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Bidirectional Heuristic Search Algorithm
+Normal rank
@@ Property / cites work @@
+Bidirectional Heuristic Search Again
@@ Property / cites work: Bidirectional Heuristic Search Again / 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 @@
+Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Q3346108
@@ Property / cites work: Q3346108 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Strategies for Dynamic Programming
+Normal rank
@@ Property / cites work @@
+Q5679703
@@ Property / cites work: Q5679703 / rank @@
+Normal rank