{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T05:01:18Z","timestamp":1772082078288,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T00:00:00Z","timestamp":1510704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10479-017-2694-x","type":"journal-article","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T03:49:12Z","timestamp":1510717752000},"page":"99-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["A note on linearized reformulations for a class of bilevel linear integer problems"],"prefix":"10.1007","volume":"272","author":[{"given":"M. Hosein","family":"Zare","sequence":"first","affiliation":[]},{"given":"Juan S.","family":"Borrero","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,15]]},"reference":[{"issue":"4","key":"2694_CR1","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.orl.2006.08.008","volume":"35","author":"W Adams","year":"2007","unstructured":"Adams, W., & Forrester, R. (2007). Linear forms of nonlinear expressions: New insights on old ideas. Operations Research Letters, 35(4), 510\u2013518.","journal-title":"Operations Research Letters"},{"issue":"6","key":"2694_CR2","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1287\/opre.1120.1106","volume":"60","author":"W Adams","year":"2012","unstructured":"Adams, W., & Henry, S. (2012). Base-2 expansions for linearizing products of functions of discrete variables. Operations Research, 60(6), 1477\u20131490.","journal-title":"Operations Research"},{"issue":"2","key":"2694_CR3","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1049\/iet-gtd.2009.0098","volume":"4","author":"JM Arroyo","year":"2010","unstructured":"Arroyo, J. M. (2010). Bilevel programming applied to power system vulnerability analysis under multiple contingencies. IET Generation, Transmission and Distribution, 4(2), 178\u2013190.","journal-title":"IET Generation, Transmission and Distribution"},{"issue":"2","key":"2694_CR4","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/TPWRS.2005.846198","volume":"20","author":"JM Arroyo","year":"2005","unstructured":"Arroyo, J. M., & Galiana, F. D. (2005). On the solution of the bilevel programming formulation of the terrorist threat problem. IEEE Transactions on Power Systems, 20(2), 789\u2013797.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"2","key":"2694_CR5","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. (1997). Links between linear bilevel and mixed 0\u20131 programming problems. Journal of Optimization Theory and Applications, 93(2), 273\u2013300.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"2694_CR6","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. (2007). New branch-and-cut algorithm for bilevel linear programming. Journal of Optimization Theory and Applications, 134(2), 353\u2013370.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"2694_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","volume":"9","author":"JF Bard","year":"1982","unstructured":"Bard, J. F., & Falk, J. E. (1982). An explicit solution to the multi-level programming problem. Computers and Operations Research, 9(1), 77\u2013100.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"2694_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0911017","volume":"11","author":"JF Bard","year":"1990","unstructured":"Bard, J. F., & Moore, J. T. (1990). A branch and bound algorithm for the bilevel programming problem. SIAM Journal on Scientific and Statistical Computing, 11(2), 281\u2013292.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"issue":"2","key":"2694_CR9","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/TPWRS.2011.2170441","volume":"27","author":"L Baringo","year":"2012","unstructured":"Baringo, L., & Conejo, A. J. (2012). Transmission and wind power investment. IEEE Transactions on Power Systems, 27(2), 885\u2013893.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"1","key":"2694_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10589-015-9799-4","volume":"64","author":"B Beheshti","year":"2016","unstructured":"Beheshti, B., Prokopyev, O. A., & Pasiliao, E. L. (2016). Exact solution approaches for bilevel assignment problems. Computational Optimization and Applications, 64(1), 215\u2013242.","journal-title":"Computational Optimization and Applications"},{"issue":"8","key":"2694_CR11","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","volume":"30","author":"WF Bialas","year":"1984","unstructured":"Bialas, W. F., & Karwan, M. H. (1984). Two-level linear programming. Management Science, 30(8), 1004\u20131020.","journal-title":"Management Science"},{"issue":"4","key":"2694_CR12","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.orl.2016.03.015","volume":"44","author":"JS Borrero","year":"2016","unstructured":"Borrero, J. S., Gillen, C., & Prokopyev, O. A. (2016). A simple technique to improve linearized reformulations of fractional (hyperbolic) 0\u20131 programming problems. Operations Research Letters, 44(4), 479\u2013486.","journal-title":"Operations Research Letters"},{"issue":"6","key":"2694_CR13","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., Salmer\u00f3n, J., & Wood, K. (2006). Defending critical infrastructure. Interfaces, 36(6), 530\u2013544.","journal-title":"Interfaces"},{"issue":"2","key":"2694_CR14","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/S0377-2217(99)00297-0","volume":"126","author":"M Camp\u00ealo","year":"2000","unstructured":"Camp\u00ealo, M., & Scheimberg, S. (2000). A note on a modified simplex approach for solving bilevel linear programming problems. European Journal of Operational Research, 126(2), 454\u2013458.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2694_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.ejor.2004.05.016","volume":"169","author":"D Cao","year":"2006","unstructured":"Cao, D., & Chen, M. (2006). Capacitated plant selection in a decentralized manufacturing environment: A bilevel optimization approach. European Journal of Operational Research, 169(1), 97\u2013110.","journal-title":"European Journal of Operational Research"},{"key":"2694_CR16","unstructured":"Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (2013). A complexity and approximability study of the bilevel knapsack problem. In: M. Goemans & J. Correa (Eds.), Integer programming and combinatorial optimization 2013. Lecture Notes in Computer Science (vol. 7801, pp. 98\u2013109). Springer Heidelberg."},{"issue":"2","key":"2694_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10288-005-0071-0","volume":"3","author":"B Colson","year":"2005","unstructured":"Colson, B., Marcotte, P., & Savard, G. (2005). Bilevel programming: A survey. 4OR, 3(2), 87\u2013107.","journal-title":"4OR"},{"issue":"1","key":"2694_CR18","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. (2007). An overview of bilevel optimization. Annals of Operations Research, 153(1), 235\u2013256.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2694_CR19","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1287\/mnsc.21.3.362","volume":"21","author":"H Corley Jr","year":"1974","unstructured":"Corley, H, Jr., & Chang, H. (1974). Finding the \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                   most vital nodes in a flow network. Management Science, 21(3), 362\u2013364.","journal-title":"Management Science"},{"key":"2694_CR20","unstructured":"CPLEX, I. I. (2016). Available at \n                    http:\/\/www-01.ibm.com\/software\/info\/ilog\/\n                    \n                  . Accessed on 7 Jan (2016)."},{"key":"2694_CR21","volume-title":"Foundations of bilevel programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S. (2002). Foundations of bilevel programming. Berlin: Springer Science & Business Media."},{"key":"2694_CR22","unstructured":"DeNegre, S. (2011). Interdiction and discrete bilevel linear programming. Ph.D. thesis, Lehigh University."},{"key":"2694_CR23","unstructured":"DeNegre, S. T., & Ralphs, T. K. (2009). A branch-and-cut algorithm for bilevel integer programming. In Proceedings of the 11th INFORMS computing society meeting (pp. 65\u201378)."},{"issue":"9","key":"2694_CR24","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1057\/jors.1981.156","volume":"32","author":"J Fortuny-Amat","year":"1981","unstructured":"Fortuny-Amat, J., & McCarl, B. (1981). A representation and economic interpretation of a two-level programming problem. Journal of The Operational Research Society, 32(9), 783\u2013792.","journal-title":"Journal of The Operational Research Society"},{"issue":"2","key":"2694_CR25","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.orl.2011.12.004","volume":"40","author":"AS Freire","year":"2012","unstructured":"Freire, A. S., Moreno, E., & Vielma, J. P. (2012). An integer linear programming approach for bilinear integer programming. Operations Research Letters, 40(2), 74\u201377.","journal-title":"Operations Research Letters"},{"issue":"1","key":"2694_CR26","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"DR Fulkerson","year":"1977","unstructured":"Fulkerson, D. R., & Harding, G. C. (1977). Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming, 13(1), 116\u2013118.","journal-title":"Mathematical Programming"},{"issue":"3","key":"2694_CR27","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1109\/TPWRS.2009.2021230","volume":"24","author":"LP Garc\u00e9s","year":"2009","unstructured":"Garc\u00e9s, L. P., Conejo, A. J., Garc\u00eda-Bertrand, R., & Romero, R. (2009). A bilevel approach to transmission expansion planning within a market environment. IEEE Transactions on Power Systems, 24(3), 1513\u20131522.","journal-title":"IEEE Transactions on Power Systems"},{"key":"2694_CR28","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.compchemeng.2015.12.007","volume":"86","author":"P Garcia-Herreros","year":"2016","unstructured":"Garcia-Herreros, P., Zhang, L., Misra, P., Arslan, E., Mehta, S., & Grossmann, I. E. (2016). Mixed-integer bilevel optimization for capacity planning with rational markets. Computers and Chemical Engineering, 86, 33\u201347.","journal-title":"Computers and Chemical Engineering"},{"issue":"4","key":"2694_CR29","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover, F. (1975). Improved linear integer programming formulations of nonlinear integer problems. Management Science, 22(4), 455\u2013460.","journal-title":"Management Science"},{"issue":"1","key":"2694_CR30","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover, F., & Woolsey, E. (1974). Technical note: Converting the 0\u20131 polynomial programming problem to a 0\u20131 linear program. Operations Research, 22(1), 180\u2013182.","journal-title":"Operations Research"},{"issue":"2","key":"2694_CR31","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/110836183","volume":"23","author":"A Gupte","year":"2013","unstructured":"Gupte, A., Ahmed, S., Cheon, M. S., & Dey, S. (2013). Solving mixed integer bilinear problems using MILP formulations. SIAM Journal on Optimization, 23(2), 721\u2013744.","journal-title":"SIAM Journal on Optimization"},{"issue":"5","key":"2694_CR32","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. (1992). New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing, 13(5), 1194\u20131217.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"issue":"2","key":"2694_CR33","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow, R. G. (1985). The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming, 32(2), 146\u2013164.","journal-title":"Mathematical Programming"},{"issue":"1","key":"2694_CR34","first-page":"77","volume":"8","author":"JJ J\u00fadice","year":"1988","unstructured":"J\u00fadice, J. J., & Faustino, A. (1988). The solution of the linear bilevel programming problem by using the linear complementarity problem. Investiga\u00e7\u00e3o Operacional, 8(1), 77\u201395.","journal-title":"Investiga\u00e7\u00e3o Operacional"},{"issue":"1","key":"2694_CR35","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G. P. (1976). Computability of global solutions to factorable nonconvex programs: Part I-convex underestimating problems. Mathematical Programming, 10(1), 147\u2013175.","journal-title":"Mathematical Programming"},{"key":"2694_CR36","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., & V\u00e4rbrand, P. (1998). Multilevel optimization: Algorithms and applications. Norwell: Kluwer."},{"issue":"2","key":"2694_CR37","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1109\/TPWRS.2011.2177281","volume":"27","author":"JM Morales","year":"2012","unstructured":"Morales, J. M., Pinson, P., & Madsen, H. (2012). A transmission-cost-based model to estimate the amount of market-integrable wind resources. IEEE Transactions on Power Systems, 27(2), 1060\u20131069.","journal-title":"IEEE Transactions on Power Systems"},{"key":"2694_CR38","doi-asserted-by":"crossref","unstructured":"Motto, A. L. (2005). On the exact solution of a class of stackelberg games. In Proceedings of the 2005, American control conference, 2005 (pp. 249\u2013250). IEEE.","DOI":"10.1109\/ACC.2005.1469940"},{"issue":"3","key":"2694_CR39","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1109\/TPWRS.2005.851942","volume":"20","author":"AL Motto","year":"2005","unstructured":"Motto, A. L., Arroyo, J. M., & Galiana, F. D. (2005). A mixed-integer lp procedure for the analysis of electric grid security under disruptive threat. IEEE Transactions on Power Systems, 20(3), 1357\u20131365.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"2","key":"2694_CR40","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TPWRS.2012.2219326","volume":"28","author":"H Pandzic","year":"2013","unstructured":"Pandzic, H., Conejo, A. J., & Kuzle, I. (2013). An EPEC approach to the yearly maintenance scheduling of generating units. IEEE Transactions on Power Systems, 28(2), 922\u2013930.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"1","key":"2694_CR41","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1109\/TPWRS.2011.2159743","volume":"27","author":"H Pandzic","year":"2012","unstructured":"Pandzic, H., Conejo, A. J., Kuzle, I., & Caro, E. (2012). Yearly maintenance scheduling of transmission lines within a market environment. IEEE Transactions on Power Systems, 27(1), 407\u2013415.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"1","key":"2694_CR42","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TPWRS.2012.2204073","volume":"28","author":"D Pozo","year":"2013","unstructured":"Pozo, D., Sauma, E. E., & Contreras, J. (2013). A three-level static milp model for generation and transmission expansion planning. IEEE Transactions on Power Systems, 28(1), 202\u2013210.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"7","key":"2694_CR43","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1049\/iet-gtd.2012.0369","volume":"7","author":"MJ Rider","year":"2013","unstructured":"Rider, M. J., L\u00f3pez-Lezama, J. M., Contreras, J., & Padilha-Feltrin, A. (2013). Bilevel approach for optimal location and contract pricing of distributed generation in radial distribution systems using mixed-integer linear programming. IET Generation, Transmission and Distribution, 7(7), 724\u2013734.","journal-title":"IET Generation, Transmission and Distribution"},{"issue":"2","key":"2694_CR44","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1109\/TPWRS.2011.2170439","volume":"27","author":"C Ruiz","year":"2012","unstructured":"Ruiz, C., Conejo, A. J., & Smeers, Y. (2012). Equilibria in an oligopolistic electricity pool with stepwise offer curves. IEEE Transactions on Power Systems, 27(2), 752\u2013761.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"1","key":"2694_CR45","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11590-006-0019-0","volume":"1","author":"H Sherali","year":"2007","unstructured":"Sherali, H., & Smith, J. (2007). An improved linearization strategy for zero\u2013one quadratic programming problems. Optimization Letters, 1(1), 33\u201347.","journal-title":"Optimization Letters"},{"key":"2694_CR46","first-page":"1","volume":"66","author":"Y Tang","year":"2015","unstructured":"Tang, Y., Richard, J., & Smith, J. (2015). A class of algorithms for mixed-integer bilevel min\u2013max optimization. Journal of Global Optimization, 66, 1\u201338.","journal-title":"Journal of Global Optimization"},{"issue":"1\u20132","key":"2694_CR47","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"J Vielma","year":"2011","unstructured":"Vielma, J., & Nemhauser, G. (2011). Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Mathematical Programming, 128(1\u20132), 49\u201372.","journal-title":"Mathematical Programming"},{"issue":"6","key":"2694_CR48","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"L Watters","year":"1967","unstructured":"Watters, L. (1967). Reduction of integer polynomial programming problems to zero\u2013one linear programming problems. Operations Research, 15(6), 1171\u20131174.","journal-title":"Operations Research"},{"issue":"1","key":"2694_CR49","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/S0377-2217(96)00258-5","volume":"101","author":"TH Wu","year":"1997","unstructured":"Wu, T. H. (1997). A note on a global approach for general 0\u20131 fractional programming. European Journal of Operational Research, 101(1), 220\u2013223.","journal-title":"European Journal of Operational Research"},{"issue":"99","key":"2694_CR50","first-page":"1237","volume":"PP","author":"H Ye","year":"2016","unstructured":"Ye, H., Wang, J., & Li, Z. (2016). MIP reformulation for max\u2013min problems in two-stage robust SCUC. IEEE Transactions on Power Systems, PP(99), 1237\u20131247.","journal-title":"IEEE Transactions on Power Systems"},{"key":"2694_CR51","unstructured":"Zeng, B., & An, Y. (2014). Solving bilevel mixed integer program by reformulations and decomposition. Optimization On-line."},{"issue":"15","key":"2694_CR52","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1016\/j.dam.2010.06.006","volume":"158","author":"R Zenklusen","year":"2010","unstructured":"Zenklusen, R. (2010). Matching interdiction. Discrete Applied Mathematics, 158(15), 1676\u20131690.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2694-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2694-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2694-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T10:19:07Z","timestamp":1576750747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2694-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,15]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["2694"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2694-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,15]]},"assertion":[{"value":"15 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}