A Reach and Bound algorithm for acyclic dynamic-programming networks

DOI10.1002/NET.20219MaRDI QIDQ3632964zbMATH OpenOpenAlexFDO

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

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

dynamic programming networkspruningshortest path problem

Mathematics Subject Classification ID

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

Recommendations

• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
• Constructing maximal dynamic flows from static flows
• A dynamic programming algorithm for the local access telecommunication network expansion problem
• Dynamic optimization for reachability problems.

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3632964)