Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
Published Online:16 Mar 2015https://doi.org/10.1287/ijoc.2014.0622
- Cited by
- 14 December 2023 | INFORMS Journal on Computing, Vol. 36, No. 2
- 23 August 2023 | INFORMS Journal on Computing, Vol. 36, No. 1
- 9 December 2022 | Transportation Science, Vol. 57, No. 3
- Knowledge-Based Systems, Vol. 242
- 21 September 2020 | INFORMS Journal on Computing, Vol. 33, No. 2
- 11 May 2017 | Soft Computing, Vol. 22, No. 12
- Knowledge-Based Systems, Vol. 128
- 28 December 2016 | Mathematical Programming Computation, Vol. 9, No. 2
- 10 March 2016 | Mathematical Programming Computation, Vol. 8, No. 4
Volume 27, Issue 2
Spring 2015
Pages 193-430
Article Information
Supplemental Material
Metrics
Information
- Received:October 01, 2013
- Accepted:August 01, 2014
- Published Online:March 16, 2015
Copyright © 2015, INFORMS
Cite as
Zhang-Hua Fu, Jin-Kao Hao (2015) Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints. INFORMS Journal on Computing 27(2):221-237.
https://doi.org/10.1287/ijoc.2014.0622
Keywords
