{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:39:10Z","timestamp":1743089950459,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"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_22","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"306-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Decomposition of\u00a0Probability Marginals for\u00a0Security Games in\u00a0Abstract Networks"],"prefix":"10.1007","author":[{"given":"Jannik","family":"Matuschke","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.orl.2015.11.005","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., Nasrabadi, E., Orlin, J.B.: On the power of randomization in network interdiction. Oper. Res. Lett. 44, 114\u2013120 (2016)","journal-title":"Oper. Res. Lett."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/opre.2016.1560","volume":"65","author":"J Correa","year":"2017","unstructured":"Correa, J., Harks, T., Kreuzen, V.J., Matuschke, J.: Fare evasion in transit networks. Oper. Res. 65, 165\u2013183 (2017)","journal-title":"Oper. Res."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/moor.2021.1140","volume":"47","author":"M Dahan","year":"2022","unstructured":"Dahan, M., Amin, S., Jaillet, P.: Probability distributions on partially ordered sets and network interdiction games. Math. Oper. Res. 47, 458\u2013484 (2022)","journal-title":"Math. Oper. Res."},{"key":"22_CR4","first-page":"271","volume":"269","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 269, 271 (1959)","journal-title":"Numer. Math."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.orl.2019.10.012","volume":"48","author":"Y Disser","year":"2020","unstructured":"Disser, Y., Matuschke, J.: The complexity of computing a robust flow. Oper. Res. Lett. 48, 18\u201323 (2020)","journal-title":"Oper. Res. Lett."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/BF01580250","volume":"6","author":"AJ Hoffman","year":"1974","unstructured":"Hoffman, A.J.: A generalization of max flow\u2013min cut. Math. Program. 6, 352\u2013359 (1974)","journal-title":"Math. Program."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/opre.2020.2023","volume":"69","author":"T Holzmann","year":"2021","unstructured":"Holzmann, T., Smith, J.C.: The shortest path interdiction problem with randomized interdiction strategies: Complexity and algorithms. Oper. Res. 69, 82\u201399 (2021)","journal-title":"Oper. Res."},{"key":"22_CR9","unstructured":"Kappmeier, J.P.W.: Generalizations of flows over time with applications in evacuation optimization, Ph. D. thesis, TU Berlin (2015)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2014.04.012","volume":"544","author":"JPW Kappmeier","year":"2014","unstructured":"Kappmeier, J.P.W., Matuschke, J., Peis, B.: Abstract flows over time: a first step towards solving dynamic packing problems. Theoret. Comput. Sci. 544, 74\u201383 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR11","unstructured":"Karbstein, M.: Line planning and connectivity, Ph. D. thesis, TU Berlin (2013)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-68891-4_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Martens","year":"2008","unstructured":"Martens, M., McCormick, S.T.: A polynomial algorithm for weighted abstract flow. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 97\u2013111. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68891-4_7"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Matuschke, J.: Decomposition of probability marginals for security games in abstract networks. Tech. rep., arXiv:2211.04922 (2022)","DOI":"10.1007\/978-3-031-32726-1_22"},{"key":"22_CR14","unstructured":"McCormick, S.T.: A polynomial algorithm for abstract maximum flow. In: Proceedings of the 7th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 490\u2013497 (1996)"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Pyakurel, U., Khanal, D.P., Dhamala, T.N.: Abstract network flow with intermediate storage for evacuation planning. Eur. J. Oper. Res. 305, 1178\u20131193 (2022)","DOI":"10.1016\/j.ejor.2022.06.054"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10107-016-1011-9","volume":"161","author":"D Szeszl\u00e9r","year":"2017","unstructured":"Szeszl\u00e9r, D.: Security games on matroids. Math. Program. 161, 347\u2013364 (2017)","journal-title":"Math. Program."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Tambe, M.: Security and game theory: Algorithms, deployed systems, lessons learned. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511973031"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T14:02:38Z","timestamp":1702476158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_22","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)"}}]}}