{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T00:17:20Z","timestamp":1778890640194,"version":"3.51.4"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030335847","type":"print"},{"value":"9783030335854","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,10,27]],"date-time":"2019-10-27T00:00:00Z","timestamp":1572134400000},"content-version":"tdm","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-33585-4_26","type":"book-chapter","created":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T12:03:38Z","timestamp":1572091418000},"page":"260-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Network Reconstruction \u2013 A New Approach to the Traveling Salesman Problem and Complexity"],"prefix":"10.1007","author":[{"given":"Elias","family":"Munapo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,27]]},"reference":[{"key":"26_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: 8\/7 - approximation algorithm for (1, 2) - TSP. In: Proceedings of the 17th ACM-SIAM SODA Conference, pp. 641\u2013648 (2006)","DOI":"10.1145\/1109557.1109627"},{"key":"26_CR3","unstructured":"Branch, J., Freeman, M., Halaka, S.: Prim\u2019s Minimum Spanning Tree, Section\u00a03.3. \n                  http:\/\/www.cs.rpi.edu\/~musser\/gp\/algorithm-concepts\/prim-screen.pdf\n                  \n                . Accessed 06 June 2019"},{"key":"26_CR4","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"WJ Cook","year":"2012","unstructured":"Cook, W.J.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton (2012)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2011.09.017","volume":"218","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Interior point methods: 25 years later. Eur. J. Oper. Res. 218, 587\u2013601 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR6","volume-title":"The Traveling Salesman Problem and Its Variants","author":"G Gutin","year":"2006","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variants. Springer, Heidelberg (2006)"},{"key":"26_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9781420039597","volume-title":"Integer Programming: Theory and Practice","author":"JK Karlof","year":"2005","unstructured":"Karlof, J.K.: Integer Programming: Theory and Practice. CRC Press Inc., Boca Raton (2005)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s12597-017-0318-5","volume":"55","author":"S Kumar","year":"2018","unstructured":"Kumar, S., Munapo, E., Lesaoana, M., Nyamugure, P.: A minimum spanning tree based heuristic for the traveling salesman tour. OPSEARCH 55, 150\u2013164 (2018)","journal-title":"OPSEARCH"},{"key":"26_CR9","unstructured":"Mitchell, J.E.: Branch and cut algorithms for integer programming. In: Christodous, A.F., Pardalos, P.M. (eds.) Encyclopedia of Optimization. Kluwer Academic Publishers (2001)"},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"52","DOI":"10.4102\/sajems.v16i1.175","volume":"16","author":"E Munapo","year":"2013","unstructured":"Munapo, E.: A network branch and bound approach for the travelling salesman model. SAJEMS 16(1), 52\u201363 (2013)","journal-title":"SAJEMS"},{"key":"26_CR11","first-page":"29","volume-title":"The Traveling Salesman Problem and Its Variations","author":"D Nadef","year":"2002","unstructured":"Nadef, D.: Polyhedral theory and branch and cut algorithms for the symmetric TSP. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations, pp. 29\u2013116. Kluwer, Dorcdrecht (2002)"},{"key":"26_CR12","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1989","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. North Holland, Amsterdam (1989)"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1), 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"key":"26_CR14","volume-title":"Operations Research: Applications and Algorithms","author":"WL Winston","year":"2004","unstructured":"Winston, W.L.: Operations Research: Applications and Algorithms, 4th edn. Thomson Brooks\/Cole, Boston (2004)","edition":"4"},{"key":"26_CR15","first-page":"121","volume-title":"Mathematical Programming Studies","author":"Laurence A. Wolsey","year":"1980","unstructured":"Wolsey, L.A.: Heuristics analysis, linear programming and branch and bound. In: Mathematical Programming Studies, vol. 13, pp. 121\u2013134 (1980)"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Computing and Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33585-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T12:07:32Z","timestamp":1572091652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33585-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,27]]},"ISBN":["9783030335847","9783030335854"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33585-4_26","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,27]]},"assertion":[{"value":"27 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing & Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Koh Samui","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ico0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}