{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:33:23Z","timestamp":1778715203907,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,8,12]],"date-time":"2006-08-12T00:00:00Z","timestamp":1155340800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,8,12]],"date-time":"2006-08-12T00:00:00Z","timestamp":1155340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optimization Letters"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s11590-006-0024-3","type":"journal-article","created":{"date-parts":[[2006,8,11]],"date-time":"2006-08-11T13:49:29Z","timestamp":1155304169000},"page":"259-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Disjunctive cuts for continuous linear bilevel programming"],"prefix":"10.1007","volume":"1","author":[{"given":"Charles","family":"Audet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Haddad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Savard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,8,12]]},"reference":[{"key":"24_CR1","unstructured":"Audet C. Optimisation globale structur\u00e9e: Propri\u00e9t\u00e9s, \u00e9quivalences et r\u00e9solution. Ph.D. thesis (1997)"},{"issue":"2","key":"24_CR2","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. J. Optim. Theory Appl. 93(2): 273\u2013300","journal-title":"J. Optim. Theory Appl."},{"issue":"3, Ser. A","key":"24_CR3","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s101070050072","volume":"85","author":"C. Audet","year":"1999","unstructured":"Audet C., Hansen P., Jaumard B., Savard G. (1999) A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Program. 85(3, Ser. A): 573\u2013592","journal-title":"Math. Program."},{"key":"24_CR4","unstructured":"Audet, C., Savard, G., Zghal, W. New branch-and-cut algorithm for bilevel linear programming. J. Optim. Theory Appl. (2004) (in press)"},{"issue":"3","key":"24_CR5","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas E. (1985) Disjunctive programming and a hierarchy of relaxations for discrete optimization problems.SIAM J. Disc. Meth. 6(3): 466\u2013486","journal-title":"SIAM J. Disc. Meth."},{"key":"24_CR6","unstructured":"Balas, E., Perregaard, M. Lift-and-project for mixed 0\u20131 programming: Recent progress. Technical report, Carnegie Mellon University (1999)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G. (1993) A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013324","journal-title":"Math. Program."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/S0377-2217(98)00373-7","volume":"120","author":"J.F. Bard","year":"2000","unstructured":"Bard J.F., Plummer J., Sourie J.-C. (2000). A bilevel programming approach to determining tax credits for biofuel production. Eur. J. Oper. Res. 120, 30\u201346","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0191-2615(03)00002-X","volume":"38","author":"D.H. Bernstein","year":"2004","unstructured":"Bernstein D.H., Chen M. (2004) Solving the toll design problem with multiple user groups. Transpor. Res. B 38, 61\u201379","journal-title":"Transpor. Res. B"},{"key":"24_CR10","unstructured":"Bonami, P. \u00c9tude et mise en oeuvre d\u2019approches poly\u00e9driques pour la r\u00e9solution de programmes en nombres entiers ou mixtes g\u00e9n\u00e9raux. Ph.D. thesis (2003)"},{"key":"24_CR11","unstructured":"Dempe, S. Discrete bilevel optimization problems. Technical Report 12, Universitat Leipzig, Wirtschaftswissenschaftliche Fakultat, Institut fur Wirtschaftsinformatik, citeseer.ist.psu.edu\/dempe01discrete.html (1996)"},{"key":"24_CR12","first-page":"149","volume-title":"Multilevel optimization: algorithms and applications","author":"X. Deng","year":"1997","unstructured":"Deng X. (1997). Complexity issues in bilevel linear programming. In: Migdalas A., Pardalos P.M., Varbrand P. (eds). Multilevel optimization: algorithms and applications. Kluwer, Dordrecht, pp. 149\u2013164"},{"key":"24_CR13","unstructured":"Fliege, J., Vicente, L.N. A multicriteria approach to bilevel optimization. Preprint 03\u201308, Department of Mathematics, University of Coimbra, Portugal, http:\/\/www.optimization-online.org\/DB_HTML\/2003\/05\/649.html (2003)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"783","DOI":"10.2307\/2581394","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. J. Oper. Res. Soc. 32, 783\u2013792","journal-title":"J. Oper. Res. Soc."},{"key":"24_CR15","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 J. Sci. Stat. Comput. 13, 1194\u20131217","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1016\/S0305-0548(01)00066-1","volume":"29","author":"S.R. Hejazi","year":"2002","unstructured":"Hejazi S.R., Jahanshahloo G., Memariani A., Sepehri M.M. (2002) Linear bilevel programming solution by genetic algorithm. Comput. Opera. Res. 29, 1913\u20131925","journal-title":"Comput. Opera. Res."},{"issue":"81","key":"24_CR17","first-page":"379","volume":"2","author":"J. J\u00fadice","year":"1994","unstructured":"J\u00fadice J., Savard G., Vicente L. (1994) Descent approaches for quadratic bilevel programming. J. Optim. Theory Appl. 2(81): 379\u2013399","journal-title":"J. Optim. Theory Appl."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF00940846","volume":"61","author":"P. Loridan","year":"1989","unstructured":"Loridan P., Morgan J. (1989) A theoretical approximation scheme for Stackelberg problems. J. Optim. Theory Appl. 61, 95\u2013110","journal-title":"J. Optim. Theory Appl."},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Migdalas A., Pardalos P.M. (eds.). Special issue on Hierarchical and Bilevel Programming. J. Global Optim. 8(3) (1996)","DOI":"10.1007\/BF00121265"},{"key":"24_CR20","unstructured":"Savard, G. Contribution \u00e0 la programmation math\u00e9matique \u00e0 deux niveaux. Ph.D. thesis (1989)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0024-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-006-0024-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0024-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0024-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T17:58:11Z","timestamp":1652810291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-006-0024-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,12]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["24"],"URL":"https:\/\/doi.org\/10.1007\/s11590-006-0024-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,12]]},"assertion":[{"value":"6 June 2006","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2006","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}