{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:00:21Z","timestamp":1742950821807,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_29","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"447-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH"],"prefix":"10.1007","author":[{"given":"Maximilian","family":"Thiessen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Quesada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth N.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Annamalai, V., Gupta, S.K.S., Schwiebert, L.: On tree-based convergecasting in wireless sensor networks. In: 2003 IEEE Wireless Communications and Networking, WCNC 2003, vol. 3, pp. 1942\u20131947, March 2003","DOI":"10.1109\/WCNC.2003.1200684"},{"issue":"3","key":"29_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10601-012-9119-x","volume":"17","author":"P Benchimol","year":"2012","unstructured":"Benchimol, P., van Hoeve, W.J., R\u00e9gin, J.-C., Rousseau, L.-M., Rueher, M.: Improved filtering for weighted circuit constraints. Constraints 17(3), 205\u2013233 (2012)","journal-title":"Constraints"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.20166","volume":"50","author":"AS da Cunha","year":"2017","unstructured":"da Cunha, A.S., Lucena, A.: Lower and upper bounds for the degree-constrained minimum spanning tree problem. Netw.: Int. J. 50(1), 55\u201366 (2017)","journal-title":"Netw.: Int. J."},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11564751_18","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G Dooms","year":"2005","unstructured":"Dooms, G., Deville, Y., Dupont, P.: CP(graph): introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 211\u2013225. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_18"},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TMC.2011.22","volume":"11","author":"O Durmaz Incel","year":"2012","unstructured":"Durmaz Incel, O., Ghosh, A., Krishnamachari, B., Chintalapudi, K.: Fast data collection in tree-based wireless sensor networks. IEEE Trans. Mobile Comput. 11(1), 86\u201399 (2012)","journal-title":"IEEE Trans. Mobile Comput."},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10601-014-9178-2","volume":"21","author":"J-G Fages","year":"2014","unstructured":"Fages, J.-G., Lorca, X., Rousseau, L.-M.: The salesman and the tree: the importance of search in CP. Constraints 21(2), 145\u2013162 (2014). https:\/\/doi.org\/10.1007\/s10601-014-9178-2","journal-title":"Constraints"},{"key":"29_CR7","unstructured":"Fages, J.-G., Prud\u2019homme, C., Lorca, X.: Choco graph documentation. COSLING S.A.S, IMT Atlantique (2018)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.comnet.2015.02.014","volume":"81","author":"H Farhadi","year":"2015","unstructured":"Farhadi, H., Lee, H.Y., Nakao, A.: Software-defined networking: a survey. Comput. Netw. 81, 79\u201395 (2015)","journal-title":"Comput. Netw."},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-61551-2_86","volume-title":"Principles and Practice of Constraint Programming \u2014 CP96","author":"G Pesant","year":"1996","unstructured":"Pesant, G., Gendreau, M.: A view of local search in constraint programming. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 353\u2013366. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61551-2_86"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 1999","author":"F Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M.: Cost-based domain filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 189\u2013203. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48085-3_14"},{"issue":"4","key":"29_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/A:1014492408220","volume":"34","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: Embedding relaxations in global constraints for solving TSP and TSPTW. Ann. Math. Artif. Intell. 34(4), 291\u2013311 (2002)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3\u20134","key":"29_CR12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1020589922418","volume":"7","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: Optimization-oriented global constraints. Constraints 7(3\u20134), 351\u2013365 (2002)","journal-title":"Constraints"},{"key":"29_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.endm.2010.05.125","volume":"36","author":"L Gouveia","year":"2010","unstructured":"Gouveia, L., Moura, P.: Spanning trees with node degree dependent costs and knapsack reformulations. Electron. Notes Discrete Math. 36, 985\u2013992 (2010)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"29_CR15","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: part ii. Math. Program. 1(1), 6\u201325 (1971)","journal-title":"Math. Program."},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-30048-7_17","volume-title":"Principles and Practice of Constraint Programming","author":"N Isoart","year":"2019","unstructured":"Isoart, N., R\u00e9gin, J.-C.: Integration of structural constraints into TSP models. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 284\u2013299. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_17"},{"issue":"18","key":"29_CR18","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1016\/j.artint.2009.09.002","volume":"173","author":"C Lecoutre","year":"2009","unstructured":"Lecoutre, C., Sa\u00efs, L., Tabary, S., Vidal, V.: Reasoning from last conflict(s) in constraint programming. Artif. Intell. 173(18), 1592\u20131614 (2009)","journal-title":"Artif. Intell."},{"issue":"5","key":"29_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.9708\/jksci.2015.20.5.031","volume":"20","author":"S-U Lee","year":"2015","unstructured":"Lee, S.-U.: A degree-constrained minimum spanning tree algorithm using k-opt. J. Korea Soc. Comput. Inf. 20(5), 31\u201339 (2015)","journal-title":"J. Korea Soc. Comput. Inf."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Liang, C., Huang, Y., Lin, J.: An energy efficient routing scheme in wireless sensor networks. In: 22nd International Conference on Advanced Information Networking and Applications - Workshops (AINA Workshops 2008), pp. 916\u2013921, March 2008","DOI":"10.1109\/WAINA.2008.199"},{"issue":"10","key":"29_CR21","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44(10), 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"29_CR22","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"issue":"6","key":"29_CR23","doi-asserted-by":"publisher","first-page":"398","DOI":"10.17706\/IJCCE.2016.5.6.398-408","volume":"5","author":"H Liu","year":"2016","unstructured":"Liu, H., Li, J., Yang, K.: A dynamic method of constructing MST based on openflow protocol. Int. J. Comput. Commun. Eng. 5(6), 398\u2013408 (2016)","journal-title":"Int. J. Comput. Commun. Eng."},{"key":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-16711-0_7","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"P McMenemy","year":"2019","unstructured":"McMenemy, P., Veerapen, N., Adair, J., Ochoa, G.: Rigorous performance analysis of state-of-the-art TSP heuristic solvers. In: Liefooghe, A., Paquete, L. (eds.) EvoCOP 2019. LNCS, vol. 11452, pp. 99\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16711-0_7"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Perelman, L., Amin, S.: A network interdiction model for analyzing the vulnerability of water distribution systems. In: Proceedings of the 3rd International Conference on High Confidence Networked Systems, HiCoNS 2014, New York, NY, USA, pp. 135\u2013144. ACM (2014)","DOI":"10.1145\/2566468.2566480"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Prete, L., Farina, F., Campanella, M., Biancini, A.: Energy efficient minimum spanning tree in openflow networks. In: 2012 European Workshop on Software Defined Networking, pp. 36\u201341, October 2012","DOI":"10.1109\/EWSDN.2012.9"},{"key":"29_CR27","unstructured":"Prud\u2019homme, C., Fages, J.-G., Lorca, X.: Choco Documentation. TASC - LS2N CNRS UMR 6241, COSLING S.A.S. (2017)"},{"key":"29_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-13520-0_31","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J-C R\u00e9gin","year":"2010","unstructured":"R\u00e9gin, J.-C., Rousseau, L.-M., Rueher, M., van Hoeve, W.-J.: The weighted spanning tree constraint revisited. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 287\u2013291. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13520-0_31"},{"key":"29_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-99253-2_8","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"R Tin\u00f3s","year":"2018","unstructured":"Tin\u00f3s, R., Helsgaun, K., Whitley, D.: Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 95\u2013107. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_8"},{"key":"29_CR30","first-page":"29","volume":"103","author":"R Vashist","year":"2014","unstructured":"Vashist, R., Dutt, S.: Minimum spanning tree based improved routing protocol for heterogeneous wireless sensor network. Int. J. Comput. Appl. 103, 29\u201333 (2014)","journal-title":"Int. J. Comput. Appl."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T02:41:09Z","timestamp":1723603269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","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":"72","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":"25","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":"7","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":"35% - 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.08","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":"3.08","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}