APA (7th ed.) Citation

Phuntsho, T., & Gonsalves, T. (2024). Maximizing Net Present Value for Resource Constraint Project Scheduling Problems with Payments at Event Occurrences Using Approximate Dynamic Programming. Algorithms, 17(5), 180. https://doi.org/10.3390/a17050180

Chicago Style (17th ed.) Citation

Phuntsho, Tshewang, and Tad Gonsalves. "Maximizing Net Present Value for Resource Constraint Project Scheduling Problems with Payments at Event Occurrences Using Approximate Dynamic Programming." Algorithms 17, no. 5 (2024): 180. https://doi.org/10.3390/a17050180.

MLA (9th ed.) Citation

Phuntsho, Tshewang, and Tad Gonsalves. "Maximizing Net Present Value for Resource Constraint Project Scheduling Problems with Payments at Event Occurrences Using Approximate Dynamic Programming." Algorithms, vol. 17, no. 5, 2024, p. 180, https://doi.org/10.3390/a17050180.