{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:35:28Z","timestamp":1774557328036,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T00:00:00Z","timestamp":1503273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T00:00:00Z","timestamp":1503273600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["1634835"],"award-info":[{"award-number":["1634835"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["1400009"],"award-info":[{"award-number":["1400009"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10898-017-0549-2","type":"journal-article","created":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T08:19:11Z","timestamp":1503303551000},"page":"91-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On a class of bilevel linear mixed-integer programs in adversarial settings"],"prefix":"10.1007","volume":"71","author":[{"given":"M. Hosein","family":"Zare","sequence":"first","affiliation":[]},{"given":"Osman Y.","family":"\u00d6zalt\u0131n","sequence":"additional","affiliation":[]},{"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,21]]},"reference":[{"issue":"2","key":"549_CR1","first-page":"151","volume":"21","author":"A Aboussoror","year":"1995","unstructured":"Aboussoror, A., Loridan, P.: Strong\u2013weak stackelberg problems in finite dimensional spaces. Serdica Math. J. 21(2), 151\u2013170 (1995)","journal-title":"Serdica Math. J."},{"issue":"3","key":"549_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11590-006-0024-3","volume":"1","author":"C Audet","year":"2007","unstructured":"Audet, C., Haddad, J., Savard, G.: Disjunctive cuts for continuous linear bilevel programming. Optim. Lett. 1(3), 259\u2013267 (2007)","journal-title":"Optim. Lett."},{"issue":"2","key":"549_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022645805569","volume":"93","author":"C Audet","year":"1997","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: Links between linear bilevel and mixed 0\u20131 programming problems. J. Optim. Theory Appl. 93(2), 273\u2013300 (1997)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"549_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10957-007-9263-4","volume":"134","author":"C Audet","year":"2007","unstructured":"Audet, C., Savard, G., Zghal, W.: New branch-and-cut algorithm for bilevel linear programming. J. Optim. Theory Appl. 134(2), 353\u2013370 (2007)","journal-title":"J. Optim. Theory Appl."},{"key":"549_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2836-1","volume-title":"Practical Bilevel Optimization: Algorithms and Applications. Nonconvex Optimization and its Applications.","author":"JF Bard","year":"1998","unstructured":"Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"1","key":"549_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/S0377-2217(98)00373-7","volume":"120","author":"JF Bard","year":"2000","unstructured":"Bard, J.F., Plummer, J., Sourie, J.C.: A bilevel programming approach to determining tax credits for biofuel production. Eur. J. Oper. Res. 120(1), 30\u201346 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"549_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/net.20236","volume":"52","author":"H Bayrak","year":"2008","unstructured":"Bayrak, H., Bailey, M.D.: Shortest path network interdiction with asymmetric information. Networks 52(3), 133\u2013140 (2008)","journal-title":"Networks"},{"issue":"6","key":"549_CR8","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1287\/inte.1060.0252","volume":"36","author":"G Brown","year":"2006","unstructured":"Brown, G., Carlyle, M., Salmeron, J., Wood, K.: Defending critical infrastructure. Interfaces 36(6), 530\u2013544 (2006)","journal-title":"Interfaces"},{"issue":"6","key":"549_CR9","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1002\/bit.10803","volume":"84","author":"AP Burgard","year":"2003","unstructured":"Burgard, A.P., Pharkya, P., Maranas, C.D.: Optknock: a bilevel programming framework for identifying gene knockout strategies for microbial strain optimization. Biotechnol. Bioeng. 84(6), 647\u2013657 (2003)","journal-title":"Biotechnol. Bioeng."},{"issue":"1","key":"549_CR10","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/S0377-2217(01)00225-9","volume":"140","author":"D Cao","year":"2002","unstructured":"Cao, D., Leung, L.C.: A partial cooperation model for non-unique linear two-level decision problems. Eur. J. Oper. Res. 140(1), 134\u2013141 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"549_CR11","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1007\/s11590-015-0872-9","volume":"9","author":"M Caramia","year":"2015","unstructured":"Caramia, M., Mari, R.: Enhanced exact algorithms for discrete bilevel linear problems. Optim. Lett. 9(7), 1447\u20131468 (2015)","journal-title":"Optim. Lett."},{"issue":"4","key":"549_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0191-2615(04)00085-2","volume":"39","author":"S-W Chiou","year":"2005","unstructured":"Chiou, S.-W.: Bilevel programming for the continuous transport network design problem. Transp. Res. B 39(4), 361\u2013383 (2005)","journal-title":"Transp. Res. B"},{"issue":"1","key":"549_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153(1), 235\u2013256 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"549_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1057\/palgrave.rpm.5170046","volume":"2","author":"J-P C\u00f4t\u00e9","year":"2003","unstructured":"C\u00f4t\u00e9, J.-P., Savard, G.: A bilevel modelling approach to pricing and fare optimization in the airline industry. J. Revenue Pricing Manag. 2(1), 23\u201326 (2003)","journal-title":"J. Revenue Pricing Manag."},{"key":"549_CR15","volume-title":"Foundations of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"4","key":"549_CR16","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1137\/110845197","volume":"22","author":"S Dempe","year":"2012","unstructured":"Dempe, S., Mordukhovich, B.S., Zemkoho, A.B.: Sensitivity analysis for two-level value functions with applications to bilevel programming. SIAM J. Optim. 22(4), 1309\u20131343 (2012)","journal-title":"SIAM J. Optim."},{"key":"549_CR17","doi-asserted-by":"crossref","unstructured":"DeNegre, S., and Ralphs, T.K.: A branch-and-cut algorithm for bilevel integer programming. In: Proceedings of the Eleventh INFORMS Computing Society Meeting, pp. 65\u201378 (2009)","DOI":"10.1007\/978-0-387-88843-9_4"},{"key":"549_CR18","doi-asserted-by":"crossref","unstructured":"Deng, X.: Complexity issues in bilevel linear programming. In: Multilevel Optimization: Algorithms and Applications, pp. 149\u2013164. Springer, Berlin (1998)","DOI":"10.1007\/978-1-4613-0307-7_6"},{"key":"549_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"issue":"1","key":"549_CR20","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.orl.2012.10.007","volume":"41","author":"F Gzara","year":"2013","unstructured":"Gzara, F.: A cutting plane approach for bilevel hazardous material transport network design. Oper. Res. Lett. 41(1), 40\u201346 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"549_CR21","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P Hansen","year":"1992","unstructured":"Hansen, P., Jaumard, B., Savard, G.: New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13(5), 1194\u20131217 (1992)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"549_CR22","volume-title":"Handbook of Global Optimization","author":"R Horst","year":"1994","unstructured":"Horst, R., Pardalos, P.M.: Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht (1994)"},{"key":"549_CR23","unstructured":"IBM\u00a0ILOG CPLEX. \n                    http:\/\/www-01.ibm.com\/software\/info\/ilog\/\n                    \n                   (2016). Accessed on 7 Jan 2016"},{"issue":"2","key":"549_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli, E., Wood, R.: Shortest-path network interdiction. Networks 40(2), 97\u2013111 (2002)","journal-title":"Networks"},{"issue":"2","key":"549_CR25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00939672","volume":"78","author":"L Mallozzi","year":"1993","unstructured":"Mallozzi, L., Morgan, J.: $$\\varepsilon $$-mixed strategies for static continuous-kernel Stackelberg games. J. Optim. Theory Appl. 78(2), 303\u2013316 (1993)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"549_CR26","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01099649","volume":"7","author":"A Migdalas","year":"1995","unstructured":"Migdalas, A.: Bilevel programming in traffic planning: models, methods and challenge. J. Global Optim. 7(4), 381\u2013405 (1995)","journal-title":"J. Global Optim."},{"key":"549_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0307-7","volume-title":"Multilevel Optimization: Algorithms and Applications","author":"A Migdalas","year":"1998","unstructured":"Migdalas, A., Pardalos, P.M., V\u00e4rbrand, P.: Multilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Norwell (1998)"},{"issue":"3","key":"549_CR28","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1287\/trsc.36.3.271.7826","volume":"36","author":"M Patriksson","year":"2002","unstructured":"Patriksson, M., Rockafellar, R.T.: A mathematical model and descent algorithm for bilevel traffic management. Transp. Sci. 36(3), 271\u2013291 (2002)","journal-title":"Transp. Sci."},{"issue":"Suppl 2","key":"549_CR29","doi-asserted-by":"publisher","first-page":"S17","DOI":"10.1186\/1471-2105-14-S2-S17","volume":"14","author":"S Ren","year":"2013","unstructured":"Ren, S., Zeng, B., Qian, X.: Adaptive bilevel programming for optimal gene knockouts for targeted overproduction under phenotypic constraints. BMC Bioinform. 14(Suppl 2), S17 (2013)","journal-title":"BMC Bioinform."},{"issue":"3","key":"549_CR30","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.disopt.2012.07.001","volume":"9","author":"S Shen","year":"2012","unstructured":"Shen, S., Smith, J.C., Goli, R.: Exact interdiction models and algorithms for disconnecting networks via node deletions. Discrete Optim. 9(3), 172\u2013188 (2012)","journal-title":"Discrete Optim."},{"key":"549_CR31","volume-title":"The Theory of Market Economy","author":"H Stackelberg","year":"1952","unstructured":"Stackelberg, H.: The Theory of Market Economy. Oxford University Press, Oxford (1952)"},{"issue":"4","key":"549_CR32","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1109\/TPWRS.2013.2296400","volume":"29","author":"G Steeger","year":"2014","unstructured":"Steeger, G., Barroso, L.A., Rebennack, S.: Optimal bidding strategies for hydro-electric producers: a literature survey. IEEE Trans. Power Syst. 29(4), 1758\u20131766 (2014)","journal-title":"IEEE Trans. Power Syst."},{"issue":"9","key":"549_CR33","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1080\/0740817X.2014.1001928","volume":"47","author":"G Steeger","year":"2015","unstructured":"Steeger, G., Rebennack, S.: Strategic bidding for multiple price-maker hydroelectric producers. IIE Trans. 47(9), 1013\u20131031 (2015)","journal-title":"IIE Trans."},{"issue":"2","key":"549_CR34","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10898-015-0274-7","volume":"66","author":"Y Tang","year":"2016","unstructured":"Tang, Y., Richard, J.-P.P., Smith, J.C.: A class of algorithms for mixed-integer bilevel min-max optimization. J. Glob. Optim. 66(2), 225\u2013262 (2016)","journal-title":"J. Glob. Optim."},{"key":"549_CR35","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2013","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Berlin (2013)"},{"issue":"2","key":"549_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R Wood","year":"1993","unstructured":"Wood, R.: Deterministic network interdiction. Math. Comput. Model. 17(2), 1\u201318 (1993)","journal-title":"Math. Comput. Model."},{"issue":"2","key":"549_CR37","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s10878-014-9751-z","volume":"30","author":"C Xin","year":"2015","unstructured":"Xin, C., Qingge, L., Wang, J., Zhu, B.: Robust optimization for the hazardous materials transportation network design problem. J. Comb. Optim. 30(2), 320\u2013334 (2015)","journal-title":"J. Comb. Optim."},{"key":"549_CR38","doi-asserted-by":"crossref","unstructured":"Zeng, B.: Easier than we thought\u2014a practical scheme to compute pessimistic bilevel optimization problem. SSRN: \n                    http:\/\/ssrn.com\/abstract=2658342\n                    \n                  . (2015). 9 Aug 2015","DOI":"10.2139\/ssrn.2658342"},{"issue":"2","key":"549_CR39","doi-asserted-by":"publisher","first-page":"529","DOI":"10.3934\/jimo.2015.11.529","volume":"11","author":"Y Zheng","year":"2015","unstructured":"Zheng, Y., Wan, Z., Jia, S., Wang, G.: A new method for strong-weak linear bilevel programming problem. J. Ind. Manag. Optim. 11(2), 529\u2013547 (2015)","journal-title":"J. Ind. Manag. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0549-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0549-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0549-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T07:27:55Z","timestamp":1589700475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0549-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,21]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["549"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0549-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,21]]},"assertion":[{"value":"19 July 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}