A Reach and Bound algorithm for acyclic dynamic-programming networks

Matthew D. Bailey, Robert L. Smith, Jeffrey M. Alden. A Reach and Bound algorithm for acyclic dynamic-programming networks. Networks, 52(1):1-7, 2008. [doi]

@article{BaileySA08,
  title = {A Reach and Bound algorithm for acyclic dynamic-programming networks},
  author = {Matthew D. Bailey and Robert L. Smith and Jeffrey M. Alden},
  year = {2008},
  doi = {10.1002/net.20219},
  url = {http://dx.doi.org/10.1002/net.20219},
  tags = {programming},
  researchr = {https://researchr.org/publication/BaileySA08},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {52},
  number = {1},
  pages = {1-7},
}