{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:10:47Z","timestamp":1781568647719,"version":"3.54.5"},"reference-count":21,"publisher":"Elsevier BV","issue":"13","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0305-0548(01)00066-1","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T14:42:38Z","timestamp":1034088158000},"page":"1913-1925","source":"Crossref","is-referenced-by-count":147,"title":["Linear bilevel programming solution by genetic algorithm"],"prefix":"10.1016","volume":"29","author":[{"given":"S.R.","family":"Hejazi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Memariani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Jahanshahloo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.M.","family":"Sepehri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(01)00066-1_BIB1","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01580119","article-title":"A linear max\u2013min problem","volume":"5","author":"Falk","year":"1973","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/S0305-0548(01)00066-1_BIB2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TAC.1982.1102880","article-title":"On two-level optimization","volume":"AC-25","author":"Bialas","year":"1982","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/S0305-0548(01)00066-1_BIB3","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","article-title":"Two-level linear programming","volume":"30","author":"Bialas","year":"1983","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(01)00066-1_BIB4","first-page":"556","article-title":"An efficient point algorithm for a linear two-stage optimization programming","volume":"38","author":"Bard","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(01)00066-1_BIB5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0305-0548(87)90008-6","article-title":"A linear bilevel programming algorithm based on bicriteria programming","volume":"14","author":"Unlu","year":"1987","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/S0305-0548(01)00066-1_BIB6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0305-0548(88)90043-3","article-title":"A linear bilevel programming algorithm: a comment","volume":"15","author":"Candler","year":"1988","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(01)00066-1_BIB7","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/1520-6750(198810)35:5<413::AID-NAV3220350505>3.0.CO;2-6","article-title":"A note on the optimality conditions for the bilevel programming problem","volume":"35","author":"Clark","year":"1988","journal-title":"Naval Research Logistic Quarterly"},{"issue":"1","key":"10.1016\/S0305-0548(01)00066-1_BIB8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0305-0548(89)90054-3","article-title":"A note on a linear bilevel programming algorithm based on bicriteria programming","volume":"16","author":"Wen","year":"1989","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(01)00066-1_BIB9","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/opre.38.3.556","article-title":"Computational difficulties of bilevel linear programming","volume":"38","author":"Ben-Ayed","year":"1990","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/S0305-0548(01)00066-1_BIB10","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 & Operations Research"},{"issue":"5","key":"10.1016\/S0305-0548(01)00066-1_BIB11","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 Statistical and Computing"},{"issue":"2","key":"10.1016\/S0305-0548(01)00066-1_BIB12","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\/S0305-0548(01)00066-1_BIB13","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 Operational Research Society"},{"key":"10.1016\/S0305-0548(01)00066-1_BIB14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF02098174","article-title":"A sequential LCP method for bilevel linear programming","volume":"34","author":"Judice","year":"1992","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(01)00066-1_BIB15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01096412","article-title":"A penalty function approach for solving bi-level linear programs","volume":"3","author":"White","year":"1993","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0305-0548(01)00066-1_BIB16","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1109\/9.58565","article-title":"A solution for the linear static Stackelberg problem using penalty functions","volume":"35","author":"Anandalingam","year":"1990","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"1","key":"10.1016\/S0305-0548(01)00066-1_BIB17","first-page":"773","article-title":"Fuzzy approach for multi-level programming problems","volume":"23","author":"Shih","year":"1983","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(01)00066-1_BIB18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0898-1221(98)00118-7","article-title":"Interactive fuzzy programming for multilevel linear programming problem","volume":"36","author":"Sakava","year":"1997","journal-title":"Computers & Mathematics with Applications"},{"issue":"1","key":"10.1016\/S0305-0548(01)00066-1_BIB19","first-page":"1","article-title":"Genetic algorithm based approach to bilevel linear programming","volume":"28","author":"Mathieu","year":"1994","journal-title":"Recherch Ope'rationnelle\/Operations Research"},{"key":"10.1016\/S0305-0548(01)00066-1_BIB20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0098-1354(98)00267-1","article-title":"A dual temperature simulated annealing approach for solving bilevel programming problems","volume":"23","author":"Sahin","year":"1998","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/S0305-0548(01)00066-1_BIB21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF00121266","article-title":"A hybrid Tabu-Ascent algorithm for the linear bilevel programming problem","volume":"8","author":"Gendreau","year":"1996","journal-title":"Journal of Global Optimization"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000661?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000661?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T20:27:31Z","timestamp":1554755251000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054801000661"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":21,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0305054801000661"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(01)00066-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}