A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4233773303
@@ Property / OpenAlex ID: W4233773303 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
+Normal rank
@@ Property / cites work @@
+A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
+Normal rank
@@ Property / cites work @@
+A best-first search algorithm guided by a set-valued heuristic
+Normal rank
@@ Property / cites work @@
+An Algorithm for Nonlinear Knapsack Problems
@@ Property / cites work: An Algorithm for Nonlinear Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Strategies for Dynamic Programming
+Normal rank
@@ Property / cites work @@
+Discrete Dynamic Programming and Capital Allocation
+Normal rank
@@ Property / cites work @@
+Studies in Semi-Admissible Heuristics
@@ Property / cites work: Studies in Semi-Admissible Heuristics / rank @@
+Normal rank
@@ Property / cites work @@
+A Finite Renewal Algorithm for the Knapsack and Turnpike Models
+Normal rank
@@ Property / cites work @@
+Turnpike Results for Single Location Capacity Expansion
+Normal rank
@@ Property / cites work @@
+Minimum cost routing for dynamic network models
@@ Property / cites work: Minimum cost routing for dynamic network models / rank @@
+Normal rank