{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T15:10:53Z","timestamp":1716822653989},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2006,10,1]],"date-time":"2006-10-01T00:00:00Z","timestamp":1159660800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1016\/j.amc.2006.01.043","type":"journal-article","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T19:32:25Z","timestamp":1141241545000},"page":"351-355","source":"Crossref","is-referenced-by-count":16,"title":["A note on the definition of a linear bilevel programming solution"],"prefix":"10.1016","volume":"181","author":[{"given":"Charles","family":"Audet","sequence":"first","affiliation":[]},{"given":"Jean","family":"Haddad","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Savard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.amc.2006.01.043_bib1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1022645805569","article-title":"Links between linear bilevel and mixed 0\u20131 programming problems","volume":"93","author":"Audet","year":"1997","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/j.amc.2006.01.043_bib2","unstructured":"C. Audet, G. Savard, W. Zghal, New branch-and-cut algorithm for bilevel linear programming, Journal of Optimization Theory and Applications, to appear."},{"issue":"2","key":"10.1016\/j.amc.2006.01.043_bib3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0911017","article-title":"A branch and bound algorithm for the bilevel programming problem","volume":"11","author":"Bard","year":"1990","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"10.1016\/j.amc.2006.01.043_bib4","series-title":"Foundations of Bilevel Programming","author":"Dempe","year":"2002"},{"key":"10.1016\/j.amc.2006.01.043_bib5","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1057\/jors.1981.156","article-title":"A representation and economic interpretation of a two-level programming problem","volume":"32","author":"Fortuny-Amat","year":"1981","journal-title":"Journal of the Operations Research Society"},{"key":"10.1016\/j.amc.2006.01.043_bib6","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1137\/0913069","article-title":"New branch and bound rules for linear bilevel programming","volume":"13","author":"Hansen","year":"1992","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"10.1016\/j.amc.2006.01.043_bib7","unstructured":"B. Jaumard, G. Savard, X. Xiong, An exact algorithm for convex bilevel programming, Technical Report G-95-33, Les Cahiers du GERAD, 1995."},{"key":"10.1016\/j.amc.2006.01.043_bib8","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1016\/j.amc.2004.06.047","article-title":"An extended kth-best approach for linear bilevel programming","volume":"164","author":"Lu","year":"2005","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.amc.2006.01.043_bib9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.amc.2003.12.089","article-title":"An extended Kuhn\u2013Tucker approach for linear bilevel programming","volume":"162","author":"Lu","year":"2005","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.amc.2006.01.043_bib10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.amc.2003.10.031","article-title":"On the definition of linear bilevel programming solution","volume":"160","author":"Lu","year":"2005","journal-title":"Applied Mathematics and Computation"},{"issue":"4","key":"10.1016\/j.amc.2006.01.043_bib11","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0305-0548(91)90096-A","article-title":"A note on the pareto-optimality of solutions to the linear bilevel programming problem","volume":"18","author":"Marcotte","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.amc.2006.01.043_bib12","unstructured":"G. Savard, Contribution \u00e0 la programmation math\u00e9matique \u00e0 deux niveaux, Ph.D. Thesis, 1989."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300306001032?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300306001032?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T05:57:41Z","timestamp":1547791061000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300306001032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["S0096300306001032"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2006.01.043","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}