Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints

Zhang-Hua Fu, Jin-Kao Hao. Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints. INFORMS Journal on Computing, 27(2):221-237, 2015. [doi]

@article{FuH15-0,
  title = {Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints},
  author = {Zhang-Hua Fu and Jin-Kao Hao},
  year = {2015},
  doi = {10.1287/ijoc.2014.0622},
  url = {http://dx.doi.org/10.1287/ijoc.2014.0622},
  researchr = {https://researchr.org/publication/FuH15-0},
  cites = {0},
  citedby = {0},
  journal = {INFORMS Journal on Computing},
  volume = {27},
  number = {2},
  pages = {221-237},
}