{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:33:04Z","timestamp":1757622784505,"version":"3.44.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031925740"},{"type":"electronic","value":"9783031925757"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-92575-7_26","type":"book-chapter","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T13:45:56Z","timestamp":1754919956000},"page":"187-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Forest-Based Formulation for\u00a0the\u00a0Balanced Connected k-Partition Problem"],"prefix":"10.1007","author":[{"given":"Peilin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xulin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Shu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,12]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-88309-8_7","volume-title":"Advances in Artificial Intelligence \u2013 IBERAMIA 2008","author":"T Assun\u00e7\u00e3o","year":"2008","unstructured":"Assun\u00e7\u00e3o, T., Furtado, V.: A heuristic method for balanced graph partitioning: an application for the demarcation of preventive police patrol areas. In: Geffner, H., Prada, R., Machado Alexandre, I., David, N. (eds.) IBERAMIA 2008. LNCS (LNAI), vol. 5290, pp. 62\u201372. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88309-8_7"},{"unstructured":"Bornd\u00f6rfer, R., Elijazyfer, Z., Schwartz, S.: Approximating balanced graph partitions (2019). https:\/\/api.semanticscholar.org\/CorpusID:195257377","key":"26_CR2"},{"doi-asserted-by":"crossref","unstructured":"Camerini, P.M., Galbiati, G., Maffioli, F.: On the complexity of finding multi-constrained spanning trees. Discret. Appl. Math. 5, 39\u201350 (1983). https:\/\/api.semanticscholar.org\/CorpusID:205053537","key":"26_CR3","DOI":"10.1016\/0166-218X(83)90014-8"},{"doi-asserted-by":"crossref","unstructured":"Castillo, P., Bucarey, V., Davila, S., Quezada, F.: Balancing resources and demand: a bi-objective mixed-integer programming approach of healthcare districts in Chile. In: Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, Rome, pp. 341\u2013349 (2024)","key":"26_CR4","DOI":"10.5220\/0012410100003639"},{"doi-asserted-by":"crossref","unstructured":"Chen, G., Chen, Y., Chen, Z.Z., Lin, G., Liu, T., Zhang, A.: Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44, 1753\u20131773 (2020). https:\/\/api.semanticscholar.org\/CorpusID:214367006","key":"26_CR5","DOI":"10.1007\/s10878-020-00544-w"},{"doi-asserted-by":"crossref","unstructured":"Chen, L., Fang, J., Yu, Z., Tong, Y., Cao, S., Wang, L.: A data-driven region generation framework for spatiotemporal transportation service management. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Long Beach, CA, USA, pp. 3842\u20133854. ACM (2023)","key":"26_CR6","DOI":"10.1145\/3580305.3599760"},{"doi-asserted-by":"crossref","unstructured":"Chleb\u00edkov\u00e1, J.: Approximating the maximally balanced connected partition problem in graphs. Inf. Process. Lett. 60, 223\u2013230 (1996). https:\/\/api.semanticscholar.org\/CorpusID:7951659","key":"26_CR7","DOI":"10.1016\/S0020-0190(96)00175-5"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"M Dyer","year":"1985","unstructured":"Dyer, M., Frieze, A.: On the complexity of partitioning graphs into connected subgraphs. Discret. Appl. Math. 10(2), 139\u2013153 (1985)","journal-title":"Discret. Appl. Math."},{"key":"26_CR9","first-page":"85","volume":"237","author":"D Mati\u0107","year":"2014","unstructured":"Mati\u0107, D.: A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem. Appl. Math. Comput. 237, 85\u201397 (2014)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1016\/j.ejor.2020.12.059","volume":"293","author":"FK Miyazawa","year":"2021","unstructured":"Miyazawa, F.K., Moura, P.F., Ota, M.J., Wakabayashi, Y.: Partitioning a graph into balanced connected classes: formulations, separation and experiments. Eur. J. Oper. Res. 293(3), 826\u2013836 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"26_CR11","doi-asserted-by":"publisher","first-page":"112884","DOI":"10.1016\/j.disc.2022.112884","volume":"345","author":"S Schwartz","year":"2022","unstructured":"Schwartz, S.: An overview of graph covering and partitioning. Discret. Math. 345(8), 112884 (2022)","journal-title":"Discret. Math."},{"doi-asserted-by":"crossref","unstructured":"Wakabayashi, Y., Chataigner, F., Salgado, L.B.: Approximation and inapproximability results on balanced connected partitions of graphs. Discret. Math. Theor. Comput. Sci. 9 (2007). https:\/\/api.semanticscholar.org\/CorpusID:40112931","key":"26_CR12","DOI":"10.46298\/dmtcs.384"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.eswa.2018.09.001","volume":"116","author":"X Zhou","year":"2019","unstructured":"Zhou, X., Wang, H., Ding, B., Hu, T., Shang, S.: Balanced connected task allocations for multi-robot systems: an exact flow-based integer program and an approximate tree-based genetic algorithm. Expert Syst. Appl. 116, 10\u201320 (2019)","journal-title":"Expert Syst. Appl."}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92575-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T23:16:17Z","timestamp":1757373377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92575-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031925740","9783031925757"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92575-7_26","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"12 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/or2024.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}