{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:04:39Z","timestamp":1742979879551,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031175572"},{"type":"electronic","value":"9783031175589"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17558-9_10","type":"book-chapter","created":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T19:02:54Z","timestamp":1672340574000},"page":"185-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constraint Modeling for\u00a0Forest Management"],"prefix":"10.1007","author":[{"given":"Eduardo","family":"Eloy","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Bushenkov","sequence":"additional","affiliation":[]},{"given":"Salvador","family":"Abreu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"10_CR1","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, volume\u00a02 of Foundations of Artificial Intelligence. Elsevier (2006)"},{"key":"10_CR2","unstructured":"Krzysztof, R.: Apt. Principles of Constraint Programming. Cambridge University Press (2003)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Machado, R., Abreu, S., Diaz, D.: Parallel performance of declarative programming using a PGAS model. In: Sagonas, K (ed.) Practical Aspects of Declarative Languages - 15th International Symposium, PADL 2013. Rome, Italy. Proceedings, volume 7752 of Lecture Notes in Computer Science, pp. 244\u2013260. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-45284-0_17"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bettinger, P., Boston, K., Siry, J., Grebner, D.; Spatial restrictions and considerations in forest planning. In: Forest Management and Planning, pp. 249\u2013267. Academic (2017)","DOI":"10.1016\/B978-0-12-809476-1.00012-6"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Gharbi, C., Ronnqvist, M., Beaudoin, D., Carle, M.-A.: A new mixed-integer programming model for spatial forest planning. Can. J. For. Res. 49, 1493\u20131503 (2019)","DOI":"10.1139\/cjfr-2019-0152"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Gunn, E., Richards, E.: Solving the adjacency problem with stand-centered constraints. Can. J. For. Res. 35, 832\u2013842 (2005)","DOI":"10.1139\/x05-013"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Hof, J., Joyce, L.: a mixed integer linear programming approach for spatially optimizing wildlife and timber in managed forest ecosystems. Forest Sci. 39, 816\u2013834 (1993)","DOI":"10.1093\/forestscience\/39.4.816"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"McDill, M.E., Rebain, S., Braze, M.E., McDill, J., Braze, J.: Harvest scheduling with area-based adjacency constraints. Forest Sci. 48(4), 631\u2013642 (2002)","DOI":"10.1093\/forestscience\/48.4.631"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Murray, A.: Spatial restrictions in harvest scheduling. Forest Sci. 45(1), 45\u201352 (1999)","DOI":"10.1093\/forestscience\/45.1.45"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Goycoolea, M., Murray, A., Vielma, J.P., Weintraub, A.: Evaluating approaches for solving the area restriction model in harvest scheduling. Forest Sci. 55(2), 149\u2013165 (2009)","DOI":"10.1093\/forestscience\/55.2.149"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Baskent, E.Z., Keles, S.: Spatial forest planning: a review. Ecol. Model. 188, 145\u2013173 (2005)","DOI":"10.1016\/j.ecolmodel.2005.01.059"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Constantino, M., Martins, I., Borges, J.G.: A new mixed-integer programming model for harvest scheduling subject to maximum area restrictions. Oper. Res. 56(3), 542\u2013551 (2008)","DOI":"10.1287\/opre.1070.0472"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"McDill, M.E., Braze, J.: Using the branch and bound algorithm to solve forest planning problems with adjacency constraints. Forest Sci. 47(3), 403\u2013418 (2001)","DOI":"10.1093\/forestscience\/47.3.403"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Boston, K., Bettinger, P.: An analysis of monte carlo integer programming, simulated annealing, and tabu search heuristics for solving spatial harvest scheduling problems. Forest Sci. 45(2), 292\u2013301 (1999)","DOI":"10.1093\/forestscience\/45.2.292"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Borges, P., Eid, T., Bergseng, E.: Applying simulated annealing using different methods for the neighborhood search in forest planning problems. Eur. J. Oper. Res. 233(3), 700\u2013710 (2014)","DOI":"10.1016\/j.ejor.2013.08.039"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Boston, K., Bettinger, P.: Combining tabu search and genetic algorithm heuristic techniques to solve spatial harvest scheduling problems. Forest Sci. 48(1), 35\u201346 (2002)","DOI":"10.1093\/forestscience\/48.1.35"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Borges, J.G., Hoganson, H.M., Rose, D.W.: Combining a decomposition strategy with dynamic programming to solve the spatially constrained forest management scheduling problem. Forest Sci. 45(1), 201\u2013212 (1999)","DOI":"10.1093\/forestscience\/45.2.201"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Marques, S., Bushenkov, V., Lotov, A., Borges, J.G.: Building pareto frontiers for ecosystem services tradeoff analysis in forest management planning integer programs. Forests 12, 1244 (2021)","DOI":"10.3390\/f12091244"},{"key":"10_CR19","unstructured":"Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling. In: Schulte, C., Tack, G., Lagerkvist, M.Z. (eds.) Modeling and Programming with Gecode (2009). Corresponds to Gecode 6.2.0"},{"key":"10_CR20","unstructured":"Prud\u2019homme, C., Fages, J.-G., Lorca, X.: Choco Solver Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. (2016)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: Minizinc: Towards a standard CP modelling language. In: Bessiere, C. (ed.) 13th International Conference on Principles and Practice of Constraint Programming\u2014CP 2007, Providence, RI, USA, Proceedings, volume 4741 of Lecture Notes in Computer Science, pp. 529\u2013543. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"10_CR22","unstructured":"Lecoutre, C., Szczepanski, N.: Pycsp3: Modeling combinatorial constrained problems in python (2020). arXiv:2009.00326"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Michel, L., Van Hentenryck, P.: Constraint-based local search. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 223\u2013260. Springer, Berlin (2018)","DOI":"10.1007\/978-3-319-07124-4_7"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Codognet, P., Munera, D., Diaz, D., Abreu, S.: Parallel local search. In: Hamadi, Y., Sais, L. (eds.) Handbook of Parallel Constraint Reasoning, pp. 381\u2013417. Springer, Berlin (2018)","DOI":"10.1007\/978-3-319-63516-3_10"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C., Malapert, A.: Parallel constraint programming. In: Hamadi, Y., Sais, L. (eds.) Handbook of Parallel Constraint Reasoning, pp. 337\u2013379. Springer, Berlin (2018)","DOI":"10.1007\/978-3-319-63516-3_9"},{"key":"10_CR26","unstructured":"Boussemart, F., Lecoutre, C., Audemard, G., Piette, C.: Xcsp3-core: a format for representing constraint satisfaction\/optimization problems (2020). arXiv:2009.00514"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Machado, R., Pedro, V., Abreu, S.: On the scalability of constraint programming on hierarchical multiprocessor systems. In: 42nd International Conference on Parallel Processing, ICPP 2013, pp. 530\u2013535. IEEE Computer Society,Lyon, France (2013)","DOI":"10.1109\/ICPP.2013.66"}],"container-title":["Springer Proceedings in Mathematics & Statistics","Dynamic Control and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17558-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T05:38:20Z","timestamp":1728625100000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17558-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031175572","9783031175589"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17558-9_10","relation":{},"ISSN":["2194-1009","2194-1017"],"issn-type":[{"type":"print","value":"2194-1009"},{"type":"electronic","value":"2194-1017"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Dynamic Control and Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aveiro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cemapre.iseg.ulisboa.pt\/events\/event.php?id=198","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}