乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:04:06Z","timestamp":1742961846332,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_19","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"245-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Linearizable Special Cases of the Quadratic Shortest Path Problem"],"prefix":"10.1007","author":[{"given":"Eranda","family":"\u00c7ela","sequence":"first","affiliation":[]},{"given":"Bettina","family":"Klinz","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Lendl","sequence":"additional","affiliation":[]},{"given":"James B.","family":"Orlin","sequence":"additional","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]},{"given":"Lasse","family":"Wulf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"19_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, 933\u2013943 (1990)","journal-title":"Optimization"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1007\/s10878-014-9821-2","volume":"31","author":"E \u00c7ela","year":"2014","unstructured":"\u00c7ela, E., Deineko, V.G., Woeginger, G.J.: Linearizable special cases of the QAP. J. Comb. Optim. 31(3), 1269\u20131279 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9821-2","journal-title":"J. Comb. Optim."},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/s10878-017-0184-3","volume":"35","author":"A \u0106usti\u0107","year":"2017","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 (2017). https:\/\/doi.org\/10.1007\/s10878-017-0184-3","journal-title":"J. Comb. Optim."},{"key":"19_CR4","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, 1096\u20131128 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00547-7","journal-title":"J. Comb. Optim."},{"key":"19_CR5","unstructured":"Erdo\u011fan, G.: Quadratic assignment problem: linearizations and polynomial time solvable cases. Ph.D. thesis, Bilkent University (2006)"},{"key":"19_CR6","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.C.: A branch-and-cut algorithm for quadratic assignment problems based on linearizations. Comput. Oper. Res. 34, 1085\u20131106 (2007)","journal-title":"Comput. Oper. Res."},{"key":"19_CR7","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. Discrete Optim. 8, 446\u2013451 (2011)","journal-title":"Discrete Optim."},{"key":"19_CR8","first-page":"1","volume":"124","author":"J Farkas","year":"1902","unstructured":"Farkas, J.: Theorie der einfachen Ungleichungen. J. f\u00fcr die Reine und Angewandte Mathematik 124, 1\u201327 (1902)","journal-title":"J. f\u00fcr die Reine und Angewandte Mathematik"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR10","first-page":"175","volume":"32","author":"E Helly","year":"1923","unstructured":"Helly, E.: \u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkten. Jahresber. Deutsch. Math.-Verein. 32, 175\u2013176 (1923)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/s10878-017-0219-9","volume":"35","author":"H Hu","year":"2017","unstructured":"Hu, H., Sotirov, R.: Special cases of the quadratic shortest path problem. J. Comb. Optim. 35(3), 754\u2013777 (2017). https:\/\/doi.org\/10.1007\/s10878-017-0219-9","journal-title":"J. Comb. Optim."},{"key":"19_CR12","unstructured":"Hu, H., Sotirov, R.: The linearization problem of a binary quadratic problem and its applications. Working paper (2018). arXiv:1802.02426 [math.OC]"},{"key":"19_CR13","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, 219\u2013233 (2020)","journal-title":"INFORMS J. Comput."},{"key":"19_CR14","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, 754\u2013761 (2011)","journal-title":"Math. Oper. Res."},{"key":"19_CR15","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. Discrete Optim. 10, 200\u2013209 (2013)","journal-title":"Discrete Optim."},{"key":"19_CR16","unstructured":"Punnen, A.P., Walter, M., Woods, B.: A characterization of linearizable instances of the quadratic travelling salesman problem. Working paper (2017). arXiv:1708.07217 [cs.DM]"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"RC Read","year":"1975","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5, 237\u2013252 (1975)","journal-title":"Networks"},{"key":"19_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, 473\u2013485 (2018)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:02:48Z","timestamp":1702065768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","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":"30","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":"41% - 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":"11","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)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}