{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T22:30:41Z","timestamp":1772317841132,"version":"3.50.1"},"reference-count":72,"publisher":"Informa UK Limited","issue":"2","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2023,3,4]]},"DOI":"10.1080\/10556788.2022.2142581","type":"journal-article","created":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T14:29:51Z","timestamp":1672842591000},"page":"356-385","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":7,"title":["A generic optimization framework for resilient systems"],"prefix":"10.1080","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0947-7193","authenticated-orcid":false,"given":"Marc E.","family":"Pfetsch","sequence":"first","affiliation":[{"name":"Department of Mathematics, Discrete Optimization Group, TU, Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Schmitt","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Discrete Optimization Group, TU, Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"key":"CIT0001","unstructured":"D. Adjiashvili, F. Hommelsheim, M. M\u00fchlenthaler, and O. Schaudt, Fault-tolerant edge-disjoint paths \u2013 beyond uniform faults, arXiv preprint 2009.05382 (2020)."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0760-6"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1287\/ics.2011.0047"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.06.009"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMM.885.187"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-019-09423-8"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492913000032"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1137\/080734510"},{"key":"CIT0010","unstructured":"K. Bestuzheva, A. Gleixner, and S. Vigerske, A computational study of perspective cuts, arXiv preprint 2103.09573 (2021)."},{"key":"CIT0011","author":"Bienstock D.","year":"2015","journal-title":"SIAM-MOS Ser. Optim."},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2016.0697"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1287\/inte.1060.0252"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1111\/j.1538-4632.2007.00698.x"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.12.039"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.46.11.1454.12087"},{"key":"CIT0017","unstructured":"S. DeNegre, Interdiction and discrete bilevel linear programming, Ph.D. diss., Lehigh University, 2011."},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2017.08.020"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1109\/ICSRS.2017.8272798"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1650"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0831"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.02.028"},{"key":"CIT0023","unstructured":"T. Gally, Computational mixed-integer semidefinite programming, Ph.D. diss., Darmstadt, 2019."},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMM.885.119"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1322081"},{"key":"CIT0026","unstructured":"G. Gamrath, D. Anderson, K. Bestuzheva, W.K. Chen, L. Eifler, M. Gasse, P. Gemander, A. Gleixner, L. Gottwald, K. Halbig, G. Hendel, C. Hojny, T. Koch, P. Le Bodic, S.J. Maher, F. Matter, M. Miltenberger, E. M\u00fchmer, B. M\u00fcller, M.E. Pfetsch, F. Schl\u00f6sser, F. Serrano, Y. Shinano, C. Tawfik, S. Vigerske, F. Wegscheider, D. Weninger, and J. Witzig, The SCIP optimization suite 7.0, Tech. Rep., Optimization Online, 2020. Available at www.optimization-online.org\/DB_HTML\/2020\/03\/7705.html."},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2020.106907"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.3934\/naco.2012.2.695"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1002\/net.22038"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1239-7"},{"key":"CIT0032","unstructured":"J. Humpola, Gas network optimization by MINLP, Ph.D. diss., Berlin, 2014."},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9756-2"},{"key":"CIT0034","unstructured":"E. Israeli, System interdiction and defense, Ph.D. diss., Naval Postgraduate School Monterey, 1999."},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1002\/net.10039"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1002\/net.20072"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100007"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2014.06.004"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973693"},{"key":"CIT0040","unstructured":"M. Ko\u010dvara, Truss topology design with integer variables made easy, Tech. Rep., Optimization Online, 2010. Available at www.optimization-online.org\/DB_HTML\/2010\/05\/2614.html."},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1927-3_9"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2016.0721"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1589"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2017.02.007"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_17"},{"key":"CIT0046","unstructured":"S. Mars, Mixed-integer semidefinite programming with an application to truss topology design, Ph.D. diss., FAU Erlangen-N\u00fcrnberg, 2013."},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-009-9479-y"},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0436-3_3"},{"key":"CIT0049","unstructured":"MOSEK ApS, MOSEK Optimizer API for C Release 9.2.35 (2021). Available at docs.mosek.com\/9.2\/capi\/index.html"},{"key":"CIT0050","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-020-09553-4"},{"key":"CIT0051","volume-title":"Computational Complexity","author":"Papadimitriou C.","year":"1994"},{"key":"CIT0052","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2014.888426"},{"key":"CIT0053","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.09.019"},{"key":"CIT0054","doi-asserted-by":"publisher","DOI":"10.3390\/data2040040"},{"key":"CIT0055","unstructured":"A. Schrijver, Combinatorial optimization: Polyhedra and efficiency, Algorithms and Combinatorics, Vol. 24, Springer, 2003."},{"key":"CIT0056","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-017-9371-4"},{"key":"CIT0057","unstructured":"SCIP-SDP \u2013 a mixed integer semidefinite programming plugin for SCIP, 2019. Available at www.opt.tu-darmstadt.de\/scipsdp\/."},{"key":"CIT0058","doi-asserted-by":"publisher","DOI":"10.1002\/net.21996"},{"key":"CIT0059","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77247-9_24"},{"key":"CIT0060","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.06.024"},{"key":"CIT0061","volume-title":"Theory of the Market Economy","author":"Stackelberg H.v.","year":"1952"},{"key":"CIT0062","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00183-6"},{"key":"CIT0063","unstructured":"K. Tan\u0131nm\u0131\u015f and M. Sinnl, A branch-and-cut algorithm for submodular interdiction games, arXiv preprint 2103.15788 (2021)."},{"key":"CIT0064","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0559-y"},{"key":"CIT0065","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2013.2244619"},{"key":"CIT0066","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.6.934"},{"key":"CIT0067","doi-asserted-by":"publisher","DOI":"10.1002\/9780470400531.eorms0932"},{"key":"CIT0068","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2018.2803783"},{"key":"CIT0069","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2007.897487"},{"key":"CIT0070","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2013.08.003"},{"key":"CIT0071","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.05.003"},{"key":"CIT0072","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2018.10.001"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2022.2142581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T15:18:09Z","timestamp":1681399089000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2022.2142581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,4]]},"references-count":72,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3,4]]}},"alternative-id":["10.1080\/10556788.2022.2142581"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2022.2142581","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,4]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-05-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}