{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T22:06:12Z","timestamp":1764194772152,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332708"},{"type":"electronic","value":"9783031332715"}],"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-33271-5_1","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficiently Approximating High-Dimensional Pareto Frontiers for\u00a0Tree-Structured Networks Using Expansion and\u00a0Compression"],"prefix":"10.1007","author":[{"given":"Yiwei","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinru","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Grimson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Flecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla P.","family":"Gomes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"1_CR1","unstructured":"Hydroelectricity. https:\/\/en.wikipedia.org\/wiki\/Hydroelectricity. Accessed 26 Jan 2022"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-019-12179-5","volume":"10","author":"RM Almeida","year":"2019","unstructured":"Almeida, R.M., et al.: Reducing greenhouse gas emissions of amazon hydropower with strategic dam planning. Nat. Commun. 10(1), 1\u20139 (2019)","journal-title":"Nat. Commun."},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-44953-1_6","volume-title":"Principles and Practice of Constraint Programming","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A.: Multiobjective optimization by decision diagrams. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 86\u201395. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_6"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/11844297_54","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"D Brockhoff","year":"2006","unstructured":"Brockhoff, D., Zitzler, E.: Are all objectives necessary? On dimensionality reduction in evolutionary multiobjective optimization. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 533\u2013542. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11844297_54"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2013","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectrum 22(4), 425\u2013460 (2000)","journal-title":"OR Spectrum"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Finer, M., Jenkins, C.N.: Proliferation of hydroelectric dams in the Andean Amazon and implications for Andes-Amazon connectivity. PLOS ONE 7(4), 1\u20139 (2012). https:\/\/doi.org\/10.1371\/journal.pone.0035126","DOI":"10.1371\/journal.pone.0035126"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-017-9274-1","volume":"23","author":"F Fioretto","year":"2018","unstructured":"Fioretto, F., Pontelli, E., Yeoh, W., Dechter, R.: Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs. Constraints 23, 1\u201343 (2018)","journal-title":"Constraints"},{"issue":"6582","key":"1_CR10","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1126\/science.abj4017","volume":"375","author":"AS Flecker","year":"2022","unstructured":"Flecker, A.S., et al.: Reducing adverse impacts of amazon hydropower expansion. Science 375(6582), 753\u2013760 (2022)","journal-title":"Science"},{"key":"1_CR11","unstructured":"Fonseca, C.M., Fleming, P.J., et al.: Genetic algorithms for multiobjective optimization: formulation discussion and generalization. In: ICGA, vol. 93, pp. 416\u2013423 (1993)"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Forsberg, B.R., et al.: The potential impact of new Andean dams on amazon fluvial ecosystems. Plos One 12(8), 1\u201335 (2017). https:\/\/doi.org\/10.1371\/journal.pone.0182254","DOI":"10.1371\/journal.pone.0182254"},{"issue":"9","key":"1_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/3339399","volume":"62","author":"C Gomes","year":"2019","unstructured":"Gomes, C., et al.: Computational sustainability: computing for a better world and a sustainable future. Commun. ACM 62(9), 56\u201365 (2019)","journal-title":"Commun. ACM"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-319-93031-2_19","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"JM Gomes-Selman","year":"2018","unstructured":"Gomes-Selman, J.M., Shi, Q., Xue, Y., Garc\u00eda-Villacorta, R., Flecker, A.S., Gomes, C.P.: Boosting efficiency for computing the Pareto frontier on tree structured networks. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 263\u2013279. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_19"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Huang, D., Yi, Z., Pu, X.: Manifold-based learning and synthesis. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 39(3), 592\u2013606 (2009). https:\/\/doi.org\/10.1109\/TSMCB.2008.2007499","DOI":"10.1109\/TSMCB.2008.2007499"},{"issue":"15","key":"1_CR16","doi-asserted-by":"publisher","first-page":"5553","DOI":"10.1073\/pnas.1203263109","volume":"109","author":"PM Kareiva","year":"2012","unstructured":"Kareiva, P.M.: Dam choices: analyses for multiple needs. Proc. Natl. Acad. Sci. 109(15), 5553\u20135554 (2012)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-36970-8_27","volume-title":"Evolutionary Multi-Criterion Optimization","author":"V Khare","year":"2003","unstructured":"Khare, V., Yao, X., Deb, K.: Performance scaling of multi-objective evolutionary algorithms. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 376\u2013390. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36970-8_27"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. 48(1) (2015). https:\/\/doi.org\/10.1145\/2792984","DOI":"10.1145\/2792984"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Lin, X., Zhen, H.L., Li, Z., Zhang, Q., Kwong, S.: Pareto multi-task learning (2019). https:\/\/doi.org\/10.48550\/ARXIV.1912.12854","DOI":"10.48550\/ARXIV.1912.12854"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Ma, P., Du, T., Matusik, W.: Efficient continuous pareto exploration in multi-task learning (2020). https:\/\/doi.org\/10.48550\/ARXIV.2006.16434","DOI":"10.48550\/ARXIV.2006.16434"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Mahapatra, D., Rajan, V.: Exact pareto optimal search for multi-task learning: touring the pareto front (2021). https:\/\/doi.org\/10.48550\/ARXIV.2108.00597","DOI":"10.48550\/ARXIV.2108.00597"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"McInnes, L., Healy, J., Melville, J.: UMAP: uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018)","DOI":"10.21105\/joss.00861"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Nowak, D., K\u00fcfer, K.H.: A ray tracing technique for the navigation on a non-convex pareto front (2020). https:\/\/doi.org\/10.48550\/ARXIV.2001.03634","DOI":"10.48550\/ARXIV.2001.03634"},{"key":"1_CR24","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 86\u201392. IEEE (2000)"},{"key":"1_CR25","unstructured":"Schaffer, J.D.: Some experiments in machine learning using vector evaluated genetic algorithms (1985). https:\/\/www.osti.gov\/biblio\/5673304"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-319-66158-2_38","volume-title":"Principles and Practice of Constraint Programming","author":"T Soh","year":"2017","unstructured":"Soh, T., Banbara, M., Tamura, N., Le Berre, D.: Solving multiobjective discrete optimization problems with propositional minimal model generation. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 596\u2013614. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_38"},{"issue":"3","key":"1_CR27","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas, N., Deb, K.: Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221\u2013248 (1994)","journal-title":"Evol. Comput."},{"key":"1_CR28","unstructured":"United Nations General Assembly: Transforming our world: the 2030 agenda for sustainable development (2015). https:\/\/sdgs.un.org\/2030agenda"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-540-70928-2_56","volume-title":"Evolutionary Multi-Criterion Optimization","author":"T Wagner","year":"2007","unstructured":"Wagner, T., Beume, N., Naujoks, B.: Pareto-, aggregation-, and indicator-based methods in many-objective optimization. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 742\u2013756. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70928-2_56"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Wiecek, M.M., Ehrgott, M., Fadel, G., Figueira, J.R.: Multiple criteria decision making for engineering (2008)","DOI":"10.1016\/j.omega.2006.10.001"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Wu, X., et al.: Efficiently approximating the pareto frontier: hydropower dam placement in the amazon basin. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11347"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00027-014-0377-0","volume":"77","author":"C Zarfl","year":"2015","unstructured":"Zarfl, C., Lumsdon, A.E., Berlekamp, J., Tydecks, L., Tockner, K.: A global boom in hydropower dam construction. Aquat. Sci. 77(1), 161\u2013170 (2015)","journal-title":"Aquat. Sci."},{"issue":"6","key":"1_CR33","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Ziv, G., Baran, E., Nam, S., Rodr\u00edguez-Iturbe, I., Levin, S.A.: Trading-off fish biodiversity, food security, and hydropower in the Mekong river basin. Proc. Natl. Acad. Sci. 109(15), 5609\u20135614 (2012). https:\/\/doi.org\/10.1073\/pnas.1201423109. https:\/\/www.pnas.org\/content\/109\/15\/5609","DOI":"10.1073\/pnas.1201423109"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33271-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:17Z","timestamp":1684774997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}