A Reach and Bound algorithm for acyclic dynamic-programming networks

DOI10.1002/net.20219zbMath1162.90347OpenAlexW4233773303MaRDI QIDQ3632964

Matthew D. Bailey, Jeffrey M. Alden, Robert L. Smith

Publication date: 16 June 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/60450

zbMATH Keywords

pruningshortest path problemdynamic programming networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

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

This page was built for publication: A Reach and Bound algorithm for acyclic dynamic-programming networks