{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:44:36Z","timestamp":1742921076694,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"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-32726-1_33","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"466-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Linear Time Algorithm for\u00a0Linearizing Quadratic and\u00a0Higher-Order Shortest Path Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5099-8804","authenticated-orcid":false,"given":"Eranda","family":"\u00c7ela","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6156-688X","authenticated-orcid":false,"given":"Bettina","family":"Klinz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5660-5397","authenticated-orcid":false,"given":"Stefan","family":"Lendl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8816-2693","authenticated-orcid":false,"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7139-4092","authenticated-orcid":false,"given":"Lasse","family":"Wulf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"issue":"6","key":"33_CR1","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1080\/02331939008843626","volume":"21","author":"I Bookhold","year":"1990","unstructured":"Bookhold, I.: A contribution to quadratic assignment problems. Optimization 21(6), 933\u2013943 (1990)","journal-title":"Optimization"},{"key":"33_CR2","doi-asserted-by":"publisher","unstructured":"\u00c7ela, E., Klinz, B., Lendl, S., Orlin, J.B., Woeginger, G.J., Wulf, L.: Linearizable special cases of the quadratic shortest path problem. In: Kowalik, \u0141., Pilipczuk, M., Rza\u0327\u017cewski, P. (eds.) WG 2021. LNCS, vol. 12911, pp. 245\u2013256. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86838-3_19","DOI":"10.1007\/978-3-030-86838-3_19"},{"issue":"3","key":"33_CR3","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1007\/s10878-014-9821-2","volume":"31","author":"E Cela","year":"2016","unstructured":"Cela, E., Deineko, V.G., Woeginger, G.J.: Linearizable special cases of the QAP. J. Comb. Optim. 31(3), 1269\u20131279 (2016)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/s10878-017-0184-3","volume":"35","author":"A \u0106usti\u0107","year":"2018","unstructured":"\u0106usti\u0107, A., Punnen, A.P.: A characterization of linearizable instances of the quadratic minimum spanning tree problem. J. Comb. Optim. 35(2), 436\u2013453 (2018)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"33_CR5","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1007\/s10878-020-00547-7","volume":"39","author":"F De Meijer","year":"2020","unstructured":"De Meijer, F., Sotirov, R.: The quadratic cycle cover problem: special cases and efficient bounds. J. Comb. Optim. 39(4), 1096\u20131128 (2020)","journal-title":"J. Comb. Optim."},{"key":"33_CR6","unstructured":"Erdo\u011fan, G.: Quadratic assignment problem: linearizations and polynomial time solvable cases, Ph. D. thesis, Bilkent University (2006)"},{"issue":"4","key":"33_CR7","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1016\/j.cor.2005.05.027","volume":"34","author":"G Erdo\u011fan","year":"2007","unstructured":"Erdo\u011fan, G., Tansel, B.: A branch-and-cut algorithm for quadratic assignment problems based on linearizations. Comput. Oper. Res. 34(4), 1085\u20131106 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.disopt.2011.03.002","volume":"8","author":"G Erdo\u011fan","year":"2011","unstructured":"Erdo\u011fan, G., Tansel, B.C.: Two classes of quadratic assignment problems that are solvable as linear assignment problems. Discret. Optim. 8(3), 446\u2013451 (2011)","journal-title":"Discret. Optim."},{"key":"33_CR9","volume-title":"Satellite network design, optimization and management","author":"I Gamvros","year":"2006","unstructured":"Gamvros, I.: Satellite network design, optimization and management. University of Maryland, College Park (2006)"},{"issue":"3","key":"33_CR10","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/s10878-017-0219-9","volume":"35","author":"H Hu","year":"2018","unstructured":"Hu, H., Sotirov, R.: Special cases of the quadratic shortest path problem. J. Comb. Optim. 35(3), 754\u2013777 (2018)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"33_CR11","first-page":"219","volume":"32","author":"H Hu","year":"2020","unstructured":"Hu, H., Sotirov, R.: On solving the quadratic shortest path problem. INFORMS J. Comput. 32(2), 219\u2013233 (2020)","journal-title":"INFORMS J. Comput."},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Hu, H., Sotirov, R.: The linearization problem of a binary quadratic problem and its applications. Annal. Oper. Res. 307, 229\u2013249 (2021)","DOI":"10.1007\/s10479-021-04310-x"},{"issue":"4","key":"33_CR13","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1287\/moor.1110.0509","volume":"36","author":"SN Kabadi","year":"2011","unstructured":"Kabadi, S.N., Punnen, A.P.: An $$O(n^4)$$ algorithm for the QAP linearization problem. Math. Oper. Res. 36(4), 754\u2013761 (2011)","journal-title":"Math. Oper. Res."},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Murakami, K., Kim, H.S.: Comparative study on restoration schemes of survivable ATM networks. In: Proceedings of INFOCOM1997, vol. 1, pp. 345\u2013352. IEEE (1997)","DOI":"10.1109\/INFCOM.1997.635156"},{"key":"33_CR15","doi-asserted-by":"publisher","unstructured":"Nie, Y.M., Wu, X.: Reliable a priori shortest path problem with limited spatial and temporal dependencies. In: Lam, W., Wong, S., Lo, H. (eds.) Transportation and Traffic Theory 2009: Golden Jubilee, pp. 169\u2013195. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-1-4419-0820-9_9","DOI":"10.1007\/978-1-4419-0820-9_9"},{"issue":"3","key":"33_CR16","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.disopt.2013.02.003","volume":"10","author":"AP Punnen","year":"2013","unstructured":"Punnen, A.P., Kabadi, S.N.: A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems. Discret. Optim. 10(3), 200\u2013209 (2013)","journal-title":"Discret. Optim."},{"key":"33_CR17","unstructured":"Punnen, A.P., Walter, M., Woods, B.D.: A characterization of linearizable instances of the quadratic traveling salesman problem. arXiv preprint arXiv:1708.07217 (2017)"},{"issue":"2","key":"33_CR18","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.ejor.2018.01.054","volume":"268","author":"B Rostami","year":"2018","unstructured":"Rostami, B., et al.: The quadratic shortest path problem: complexity, approximability, and solution methods. Eur. J. Oper. Res. 268(2), 473\u2013485 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-319-20086-6_29","volume-title":"Experimental Algorithms","author":"B Rostami","year":"2015","unstructured":"Rostami, B., Malucelli, F., Frey, D., Buchheim, C.: On the quadratic shortest path problem. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 379\u2013390. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20086-6_29"},{"issue":"1","key":"33_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/trsc.35.1.37.10141","volume":"35","author":"S Sen","year":"2001","unstructured":"Sen, S., Pillai, R., Joshi, S., Rathi, A.K.: A mean-variance model for route guidance in advanced traveler information systems. Transp. Sci. 35(1), 37\u201349 (2001)","journal-title":"Transp. Sci."},{"issue":"4","key":"33_CR21","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/trsc.28.4.309","volume":"28","author":"RA Sivakumar","year":"1994","unstructured":"Sivakumar, R.A., Batta, R.: The variance-constrained shortest path problem. Transp. Sci. 28(4), 309\u2013316 (1994)","journal-title":"Transp. Sci."},{"key":"33_CR22","unstructured":"Sotirov, R., Verch\u00e9re, M.: The quadratic minimum spanning tree problem: lower bounds via extended formulations. arXiv preprint arXiv:2102.10647 (2021)"},{"key":"33_CR23","unstructured":"Waddell, L., Adams, W.: Characterizing linearizable QAPs by the level-1 reformulation-linearization technique. (2021). https:\/\/optimization-online.org\/?p=17020, preprint"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T20:43:01Z","timestamp":1729456981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_33","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":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","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":"119","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":"33","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":"0","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":"28% - 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":"2","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)"}}]}}