{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:54:21Z","timestamp":1743051261396,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819967018"},{"type":"electronic","value":"9789819967025"}],"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-981-99-6702-5_9","type":"book-chapter","created":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T18:02:42Z","timestamp":1700503362000},"page":"115-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Compact Formulation for\u00a0the\u00a0mDmSOP: Theoretical and\u00a0Computational Time Analysis"],"prefix":"10.1007","author":[{"given":"Ravi","family":"Kant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.ejor.2014.04.006","volume":"238","author":"E Angelelli","year":"2014","unstructured":"Angelelli, E., Archetti, C., Vindigni, M.: The clustered orienteering problem. Eur. J. Oper. Res. 238(2), 404\u2013414 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bazrafshan, R., Hashemkhani Zolfani, S., Mirzapour Al-e Hashem, S.M.J.: Comparison of the sub-tour elimination methods for the asymmetric traveling salesman problem applying the SECA method. Axioms 10(1), 19 (2021)","DOI":"10.3390\/axioms10010019"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006)","DOI":"10.1016\/j.omega.2004.10.004"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.ejor.2013.07.038","volume":"236","author":"T Bekta\u015f","year":"2014","unstructured":"Bekta\u015f, T., Gouveia, L.: Requiem for the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints? Eur. J. Oper. Res. 236(3), 820\u2013832 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113229","volume":"148","author":"G Campuzano","year":"2020","unstructured":"Campuzano, G., Obreque, C., Aguayo, M.M.: Accelerating the Miller\u2013Tucker\u2013Zemlin model for the asymmetric traveling salesman problem. Expert Syst. Appl. 148, 113229 (2020)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"9_CR6","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393\u2013410 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers, M., Laporte, G.: Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints. Oper. Res. Lett. 10(1), 27\u201336 (1991)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti, M., Salazar Gonz\u00e1lez, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378\u2013394 (1997)","journal-title":"Oper. Res."},{"key":"9_CR9","unstructured":"Hamilton, W.R.: Problema del viajante"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Kant, R., Mishra, A.: The multi Depot multiple set orienteering problem. Unpublished Manuscript (2022)","DOI":"10.5220\/0011681800003396"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM (JACM) 7(4), 326\u2013329 (1960)","journal-title":"J. ACM (JACM)"},{"key":"9_CR12","unstructured":"Noon, C.E.: The generalized traveling salesman problem. Ph.D. thesis. University of Michigan (1988)"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.cor.2007.11.008","volume":"36","author":"T \u00d6ncan","year":"2009","unstructured":"\u00d6ncan, T., Alt\u0131nel, I.K., Laporte, G.: A comparative analysis of several asymmetric traveling salesman problem formulations. Comput. Oper. Res. 36(3), 637\u2013654 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Sawik, T.: A note on the Miller\u2013Tucker\u2013Zemlin model for the asymmetric traveling salesman problem. Bull. Pol. Acad. Sci. Tech. Sci. 3 (2016)","DOI":"10.1515\/bpasts-2016-0057"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1287\/opre.50.4.656.2865","volume":"50","author":"HD Sherali","year":"2002","unstructured":"Sherali, H.D., Driscoll, P.J.: On tightening the relaxations of Miller\u2013Tucker\u2013Zemlin formulations for asymmetric traveling salesman problems. Oper. Res. 50(4), 656\u2013669 (2002)","journal-title":"Oper. Res."},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1\u201310 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Velednitsky, M.: Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem. arXiv preprint arXiv:1805.06997 (2018)","DOI":"10.1016\/j.orl.2017.04.010"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.orl.2020.01.008","volume":"48","author":"Y Yuan","year":"2020","unstructured":"Yuan, Y., Cattaruzza, D., Ogier, M., Semet, F.: A note on the lifted Miller\u2013Tucker\u2013Zemlin subtour elimination constraints for routing problems with time windows. Oper. Res. Lett. 48(2), 167\u2013169 (2020)","journal-title":"Oper. Res. Lett."}],"container-title":["Smart Innovation, Systems and Technologies","Evolution in Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-6702-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T06:06:51Z","timestamp":1728454011000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-6702-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819967018","9789819967025"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-6702-5_9","relation":{},"ISSN":["2190-3018","2190-3026"],"issn-type":[{"type":"print","value":"2190-3018"},{"type":"electronic","value":"2190-3026"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FICTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Frontiers of Intelligent Computing: Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cardiff","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"11 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ficta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ficta.co.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}