{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T14:24:21Z","timestamp":1774535061874,"version":"3.50.1"},"reference-count":38,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T00:00:00Z","timestamp":1677888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Dipartimento di Matematica \u201cGiuseppe Peano\u201d, Universit\u00e0 di Torino"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We propose a way of dealing with invasive species or pest control in agriculture. Ecosystems can be modeled via dynamical systems. For their study, it is necessary to establish their possible equilibria. Even a moderately complex system exhibits, in general, multiple steady states. Usually, they are related to each other through transcritical bifurcations, i.e., the system settles to a different equilibrium when some bifurcation parameter crosses a critical threshold. From a situation in which the pest is endemic, it is desirable to move to a pest-free point. The map of the system\u2019s equilibria and their connections via transcritical bifurcations may indicate a path to attain the desired state. However, to force the parameters to cross the critical threshold, some human action is required, and this effort has a cost. The tools of dynamic programming allow the detection of the cheapest path to reach the desired goal. In this paper, an algorithm for the solution to this problem is illustrated.<\/jats:p>","DOI":"10.3390\/a16030139","type":"journal-article","created":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T01:35:30Z","timestamp":1678066530000},"page":"139","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Dynamic Programming Approach to Ecosystem Management"],"prefix":"10.3390","volume":"16","author":[{"given":"Alessandra","family":"Rosso","sequence":"first","affiliation":[{"name":"Dipartimento di Matematica \u201cGiuseppe Peano\u201d, Universit\u00e0 di Torino, Via Carlo Alberto 10, 10123 Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7215-5114","authenticated-orcid":false,"given":"Ezio","family":"Venturino","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica \u201cGiuseppe Peano\u201d, Universit\u00e0 di Torino, Via Carlo Alberto 10, 10123 Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Murray, J.D. (1993). Mathematical Biology, Springer.","DOI":"10.1007\/978-3-662-08542-4"},{"key":"ref_2","unstructured":"Chong, E.K.P., and Zak, S.H. (2013). An Introduction to Optimization, Wiley. [4th ed.]."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/S1574-0021(96)01016-7","article-title":"Numerical dynamic programming in economics","volume":"1","author":"Rust","year":"1996","journal-title":"Handb. Comput. Econ."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Q. Appl. Math."},{"key":"ref_5","unstructured":"Dreyfus, S.E., and Law, A.M. (1977). The Art of Dynamic Programming, Academic Press."},{"key":"ref_6","unstructured":"Hillier, F.S., and Lieberman, G.J. (2002). Introduction to Operation Research, McGraw-Hill Higher Education. [7th ed.]."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Luenberger, D.G., and Ye, Y. (2021). Linear and Nonlinear Programming, Springer. [5th ed.].","DOI":"10.1007\/978-3-030-85450-8"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Art, L., and Mauch, H. (2007). Dynamic Programming, A Computational Tool, Springer.","DOI":"10.1007\/978-3-540-37014-7"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1038\/nbt0704-909","article-title":"What is dynamic programming?","volume":"22","author":"Eddy","year":"2004","journal-title":"Nat. Biotechnol."},{"key":"ref_10","first-page":"39","article-title":"Dynamic Programming and Decision Theory","volume":"10","author":"Lindley","year":"1961","journal-title":"J. R. Stat. Soc. Ser. C (Appl. Stat.)"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0898-1221(94)90123-6","article-title":"Dynamic Programming and Graph Optimization Problems","volume":"27","author":"Hu","year":"1994","journal-title":"Comput. Math. Appl."},{"key":"ref_12","unstructured":"Bertsekas, D.P. (2012). Massachusetts Institute of Technology, Dynamic Programming and Optimal Control, Athena Scientific. [4th ed.]."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TSSC.1965.300055","article-title":"Application of dynamic programming to routing problems","volume":"1","author":"Jefferis","year":"1965","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_14","unstructured":"An, L.N., and Quoc-Tuan, T. (2015, January 26\u201330). Optimal energy management for grid connected microgrid by using dynamic programming method. Proceedings of the 2015 IEEE Power & Energy Society General Meeting, Denver, CO, USA."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/03052157908902416","article-title":"Non-optimal dynamic programming algorithms in the design of minimum cost drainage systems","volume":"4","author":"Walters","year":"1979","journal-title":"Eng. Optim."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1029\/WR018i004p00673","article-title":"Dynamic programming applications in water resources","volume":"18","author":"Yakowitz","year":"1982","journal-title":"Water Resour. Res."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Kwon, H., Clifford, G.D., Genias, I., Bernhard, D., Esper, C.D., Factor, S.A., and McKay, J.L. (2023). An Explainable Spatial-Temporal Graphical Convolutional Network to Score Freezing of Gait in Parkinsonian Patients. Sensors, 23.","DOI":"10.1101\/2023.01.13.23284535"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1057\/rpm.2011.49","article-title":"The theory and practice of dynamic-programming-based bid prices","volume":"11","author":"Weatherford","year":"2012","journal-title":"J. Revenue Pricing Manag."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1140\/epjb\/e2015-60575-5","article-title":"Opinion formation with upper and lower bounds","volume":"88","author":"Yano","year":"2015","journal-title":"Eur. Phys. J. B"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Simonovic, S.P. (2010). Systems Approach to Management of Disasters: Methods and Applications, John Wiley & Sons.","DOI":"10.1002\/9780470890363"},{"key":"ref_21","unstructured":"Orlin, J.B., Ahuja, R.K., and Magnanti, T.L. (1993). Network Flows: Theory, Algorithms, and Applications, Pearson. [1st ed.]."},{"key":"ref_22","unstructured":"Williamson, D.P. (2019). Cornell University, Network Flow Algorithms, Cambridge University Press."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Ortega-Arranz, H., and Llanos, D.R. (2015). Arturo Gonzalez-Escribano, The Shortest-Path Problem: Analysis and Comparison of Methods, Springer.","DOI":"10.1007\/978-3-031-02574-7"},{"key":"ref_24","first-page":"99","article-title":"A review and evaluations of shortest path algorithms","volume":"2","author":"Magzhan","year":"2013","journal-title":"Int. J. Sci. Technol. Res."},{"key":"ref_25","first-page":"15","article-title":"Analysing Stagecoach Network Problem Using Dynamic Programming Algorithm","volume":"7","author":"Ekoko","year":"2008","journal-title":"Glob. J. Math. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.2298\/YJOR121120001S","article-title":"Minimum cost network flows: Problems, algorithms, and software","volume":"23","author":"Sifaleras","year":"2013","journal-title":"Yugosl. J. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1008379621400","article-title":"Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks","volume":"19","author":"Burkard","year":"2001","journal-title":"J. Glob. Optim."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"An efficient algorithm for finding minimum cuts in dense graphs","volume":"35","author":"Goldberg","year":"1988","journal-title":"J. ACM"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Brenner, U., Pauli, A., and Vygen, J. (2004, January 18\u201321). Almost optimum placement legalization by minimum cost flow and dynamic programming. Proceedings of the 2004 International Symposium on Physical Design, Phoenix, AZ, USA.","DOI":"10.1145\/981066.981069"},{"key":"ref_30","unstructured":"Fiorella, A., and Venturino, E. (2021). Comparison of two mathematical models for the Echinococcus multilocularis-red foxes-rodents interactions. Rev. Model. Matem\u00e1tico Sist. Biol., 1, Available online: https:\/\/repositorio.utem.cl\/handle\/30081993\/1172."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s11538-021-00873-9","article-title":"A mathematical model supporting a hyperpredation effect in the apparent competition between invasive Eastern cottontail and native European hare","volume":"83","author":"Caudera","year":"2021","journal-title":"Bull. Math. Biol."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"5965","DOI":"10.3934\/dcdsb.2021158","article-title":"A viral transmission model for foxes-cottontails-hares interaction: Apparent competition and infection through predation","volume":"26","author":"Viale","year":"2021","journal-title":"Discret. Contin. Dyn. Syst. Ser. B"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"10977","DOI":"10.1016\/j.ecolmodel.2021.109776","article-title":"A tritrophic interaction model for an olive tree pest, the olive moth Prays oleae (Bernard)","volume":"462","author":"Pappalardo","year":"2021","journal-title":"Ecol. Model."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Lenhart, S., and Workman, J.T. (2007). Optimal Control Applied to Biological Models, Chapman & Hall, CRC Press.","DOI":"10.1201\/9781420011418"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Cavendish, D., and Gerla, M. (1998, January 21\u201325). Internet QoS routing using the Bellman-Ford algorithm. Proceedings of the High Performance Networking: IFIP TC-6 Eighth International Conference on High Performance Networking (HPN \u201998), Vienna, Austria.","DOI":"10.1007\/978-0-387-35388-3_37"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"29","DOI":"10.26555\/jiteki.v16i1.16943","article-title":"Bellman-Ford Algorithm for Completion of Route Determination: An Experimental Study","volume":"6","author":"Muzakir","year":"2020","journal-title":"Jurnal Ilmiah Teknik Elektro Komputer dan Informatika"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Bannister, M.J., and Epstein, D. (2012, January 16). Randomized speedup of the Bellman-Ford algorithm. Proceedings of the 2012 Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Kyoto, Japan.","DOI":"10.1137\/1.9781611973020.6"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Nepomniaschaya, A.S. (2001, January 3\u20137). An associative version of the Bellman-Ford algorithm for finding the shortest paths in directed graphs. Proceedings of the Parallel Computing Technologies: 6th International Conference, PaCT 2001, Novosibirsk, Russia.","DOI":"10.1007\/3-540-44743-1_28"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/3\/139\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:47:41Z","timestamp":1760122061000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/3\/139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,4]]},"references-count":38,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["a16030139"],"URL":"https:\/\/doi.org\/10.3390\/a16030139","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,4]]}}}