{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:49:50Z","timestamp":1743130190667,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031464386"},{"type":"electronic","value":"9783031464393"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-46439-3_6","type":"book-chapter","created":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T13:02:23Z","timestamp":1704546143000},"page":"75-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-objective Finite-Domain Constraint-Based Forest 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":[[2024,1,7]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Eloy, E., Bushenkov, V., Abreu, S.: Constraint modeling for forest management. In: Tchemisova, T.V., Torres, D.F.M., Plakhov, A.Y. (eds.), Dynamic Control and Optimization, Cham, pp.\u00a0185\u2013200. Springer International Publishing (2022)","DOI":"10.1007\/978-3-031-17558-9_10"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1093\/forestscience\/39.4.816","volume":"39","author":"J Hof","year":"1993","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)","journal-title":"Forest Sci."},{"key":"6_CR3","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":"6_CR4","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1139\/x05-013","volume":"35","author":"E Gunn","year":"2005","unstructured":"Gunn, E., Richards, E.: Solving the adjacency problem with stand-centered constraints. Canadian J. Forest Res. 35, 832\u2013842 (2005)","journal-title":"Canadian J. Forest Res."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1139\/cjfr-2019-0152","volume":"49","author":"C Gharbi","year":"2019","unstructured":"Gharbi, C., Ronnqvist, M., Beaudoin, D., Carle, M.-A.: A new mixed-integer programming model for spatial forest planning. Canadian J. Forest Res. 49, 1493\u20131503 (2019)","journal-title":"Canadian J. Forest Res."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511615320"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1093\/forestscience\/45.1.45","volume":"45","author":"A Murray","year":"1999","unstructured":"Murray, A.: Spatial restrictions in harvest scheduling. Forest Sci. 45(1), 45\u201352 (1999)","journal-title":"Forest Sci."},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1287\/opre.1070.0472","volume":"56","author":"M Constantino","year":"2008","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)","journal-title":"Oper. Res."},{"key":"6_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.foreco.2020.118714","volume":"483","author":"A Pascual","year":"2021","unstructured":"Pascual, A.: Multi-objective forest planning at tree-level combining mixed integer programming and airborne laser scanning. Forest Ecol. Manag. 483, 118714 (2021)","journal-title":"Forest Ecol. Manag."},{"key":"6_CR10","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(9) (2021)","DOI":"10.3390\/f12091244"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Marques, S., Bushenkov, V.A., Lotov, A.V., Marto, M., Borges, J.G.: Bi-Level participatory forest management planning supported by pareto frontier visualization. Forest Sci. 66, 490\u2013500 (2019)","DOI":"10.1093\/forsci\/fxz014"},{"key":"6_CR12","unstructured":"Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling. In: Modeling and Programming with Gecode, Christian Schulte and Guido Tack and Mikael Z. Lagerkvist. Corresponds to Gecode 6.2.0 (2019)"},{"key":"6_CR13","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":"6_CR14","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.), Principles and Practice of Constraint Programming\u2014CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, 23\u201327 Sept. 2007, Proceedings, vol.\u00a04741 of Lecture Notes in Computer Science, pp.\u00a0529\u2013543, Springer, 2007","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"6_CR15","unstructured":"Lecoutre, C., Szczepanski, N.: Pycsp3: Modeling combinatorial constrained problems in python (2020). arXiv:2009.00326"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Michel, L., Hentenryck, P.V.: Constraint-based local search. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.), Handbook of Heuristics, pp.\u00a0223\u2013260. Springer (2018)","DOI":"10.1007\/978-3-319-07124-4_7"},{"key":"6_CR17","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.\u00a0381\u2013417. Springer (2018)","DOI":"10.1007\/978-3-319-63516-3_10"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J., Malapert, A.: Parallel constraint programming. In: Hamadi, Y., Sais, L. (eds.) Handbook of Parallel Constraint Reasoning, pp.\u00a0337\u2013379. Springer (2018)","DOI":"10.1007\/978-3-319-63516-3_9"},{"key":"6_CR19","unstructured":"Boussemart, F., Lecoutre, C., Audemard, G., Piette, C.: Xcsp3-core: a format for representing constraint satisfaction\/optimization problems (2020). arXiv:2009.00514"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. ACM Trans. Program. Lang. Syst. 31(1), 2:1\u20132:43 (2008)","DOI":"10.1145\/1452044.1452046"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP optimizer for scheduling. Constraints 23, 210\u2013250 (2018). Apr","journal-title":"Constraints"},{"key":"6_CR22","first-page":"260","volume":"66","author":"A Lotov","year":"2002","unstructured":"Lotov, A., Kamenev, G., Berezkin, V.: Approximation and visualization of pareto-efficient frontier for nonconvex multiobjective problems. Dokl 66, 260\u2013262 (2002)","journal-title":"Dokl"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Lotov, A., Bushenkov, V., Kamenev, G.: Interactive decision maps: approximation and visualization of pareto frontier. Springer (2004)","DOI":"10.1007\/978-1-4419-8851-5"}],"container-title":["Springer Proceedings in Mathematics & Statistics","Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46439-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T10:13:22Z","timestamp":1713953602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46439-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031464386","9783031464393"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46439-3_6","relation":{},"ISSN":["2194-1009","2194-1017"],"issn-type":[{"type":"print","value":"2194-1009"},{"type":"electronic","value":"2194-1017"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APDIO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Congress of the Portuguese Association of Operational Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Evora","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apdio12022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}