{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:45:00Z","timestamp":1775180700132,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T00:00:00Z","timestamp":1428019200000},"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":["Optim Lett"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11590-015-0872-9","type":"journal-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T15:09:49Z","timestamp":1428073789000},"page":"1447-1468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Enhanced exact algorithms for discrete bilevel linear problems"],"prefix":"10.1007","volume":"9","author":[{"given":"Massimiliano","family":"Caramia","sequence":"first","affiliation":[]},{"given":"Renato","family":"Mari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,3]]},"reference":[{"issue":"3","key":"872_CR1","doi-asserted-by":"crossref","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":"872_CR2","doi-asserted-by":"crossref","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":"872_CR3","doi-asserted-by":"crossref","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":"872_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2836-1","volume-title":"Practical bilevel optimization: algorithms and applications","author":"JF Bard","year":"1998","unstructured":"Bard, J.F.: Practical bilevel optimization: algorithms and applications. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"2","key":"872_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0911017","volume":"11","author":"JF Bard","year":"1990","unstructured":"Bard, J.F., Moore, J.T.: A branch and bound algorithm for the bilevel programming problem. SIAM. J. Sci. Stat. Comput. 11(2), 281\u2013292 (1990)","journal-title":"SIAM. J. Sci. Stat. Comput."},{"issue":"1","key":"872_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TAC.1982.1102880","volume":"27","author":"W Bialas","year":"1982","unstructured":"Bialas, W., Karwan, M.: On two-level optimization. IEEE. Trans. Autom. Control. 27(1), 211\u2013214 (1982)","journal-title":"IEEE. Trans. Autom. Control."},{"issue":"8","key":"872_CR7","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","volume":"30","author":"W Bialas","year":"1984","unstructured":"Bialas, W., Karwan, M.: Two-level linear programming. Manag. Sci. 30(8), 1004\u20131020 (1984)","journal-title":"Manag. Sci."},{"key":"872_CR8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.trc.2008.10.001","volume":"17","author":"L Bianco","year":"2009","unstructured":"Bianco, L., Caramia, M., Giordani, S.: A bilevel flow model for hazmat transportation network design. Transp. Res. Part. C. 17, 175\u2013196 (2009)","journal-title":"Transp. Res. Part. C."},{"issue":"1","key":"872_CR9","doi-asserted-by":"crossref","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. Annals. Oper. Res. 153(1), 235\u2013256 (2007)","journal-title":"Annals. Oper. Res."},{"key":"872_CR10","unstructured":"Dempe, S.: Foundation of bilevel programming. Kluwer Academic Publications (2002)"},{"issue":"2","key":"872_CR11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-0-387-88843-9_4","volume":"47","author":"ST DeNegre","year":"2009","unstructured":"DeNegre, S.T., Ralphs, T.K.: A branch-and-cut algorithm for integer bilevel linear programs. Oper. Res. Cyber. Infrastruct. 47(2), 65\u201378 (2009)","journal-title":"Oper. Res. Cyber. Infrastruct."},{"issue":"9","key":"872_CR12","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1057\/jors.1981.156","volume":"32","author":"J Fortuny-Amat","year":"1981","unstructured":"Fortuny-Amat, J., McCarl, B.: A representation and economic interpretation of a two-level programming problem. J. Oper. Res. Soc. 32(9), 783\u2013792 (1981)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"872_CR13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow, R.G.: The polynomial hierarchy and a simple model for competitive analysis. Math. Program. 32(2), 146\u2013164 (1985)","journal-title":"Math. Program."},{"issue":"2","key":"872_CR14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010\u2014mixed integer programming library version 5. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"872_CR15","doi-asserted-by":"crossref","unstructured":"Mansi, R., Alves, C., de Carvalho, J.M.V., Hanafi, S.: An exact algorithm for bilevel 0\u20131 knapsack problems. Hindawi Publishing Corporation Mathematical Problems in Engineering, (2012)","DOI":"10.1155\/2012\/504713"},{"issue":"5","key":"872_CR16","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1287\/opre.38.5.911","volume":"38","author":"JT Moore","year":"1990","unstructured":"Moore, J.T., Bard, J.F.: The mixed integer linear bilevel programming problem. Oper. Res. 38(5), 911\u2013921 (1990)","journal-title":"Oper. Res."},{"issue":"2","key":"872_CR17","first-page":"125","volume":"11","author":"WU Shiquan","year":"1998","unstructured":"Shiquan, W.U., Yang, C., Marcotte, P.: A cutting plane method for linear bilevel programs. Syst. Sci. Math. Sci. 11(2), 125\u2013133 (1998)","journal-title":"Syst. Sci. Math. Sci."},{"issue":"3","key":"872_CR18","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF02275351","volume":"89","author":"LN Vicente","year":"1996","unstructured":"Vicente, L.N., Savard, G., Judice, J.J.: Discrete linear bilevel programming problem. J. Optim. Theory. Appl. 89(3), 597\u2013614 (1996)","journal-title":"J. Optim. Theory. Appl."},{"issue":"2","key":"872_CR19","first-page":"125","volume":"42","author":"UP Wen","year":"1991","unstructured":"Wen, U.P., Hsu, S.T.: Linear bi-level programming problems\u2014a review. J. Oper. Res. Soc. 42(2), 125\u2013133 (1991)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"872_CR20","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0377-2217(94)00215-0","volume":"88","author":"UP Wen","year":"1996","unstructured":"Wen, U.P., Huang, A.D.: A simple tabu search method to solve the mixed-integer linear bilevel programming problem. Eur. J. Oper. Res. 88(3), 563\u2013571 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"872_CR21","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0305-0548(90)90037-8","volume":"17","author":"UP Wen","year":"1990","unstructured":"Wen, U.P., Yang, Y.H.: Algorithms for solving the mixed integer two-level linear programming problem. Comput. Oper. Res. 17(2), 133\u2013142 (1990)","journal-title":"Comput. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0872-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0872-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0872-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T21:45:44Z","timestamp":1566510344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0872-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,3]]},"references-count":21,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["872"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0872-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,3]]}}}