{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,10]],"date-time":"2023-09-10T05:08:42Z","timestamp":1694322522586},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,5,3]],"date-time":"2014-05-03T00:00:00Z","timestamp":1399075200000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10898-014-0189-8","type":"journal-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T11:33:09Z","timestamp":1399030389000},"page":"291-310","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Exact solution approach for a class of nonlinear bilevel knapsack problems"],"prefix":"10.1007","volume":"61","author":[{"given":"Behdad","family":"Beheshti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osman Y.","family":"\u00d6zalt\u0131n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Hosein","family":"Zare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,3]]},"reference":[{"issue":"2","key":"189_CR1","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."},{"key":"189_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2836-1","volume-title":"Practical bilevel optimization: algorithms and applications. Nonconvex optimization and its applications","author":"JF Bard","year":"1998","unstructured":"Bard, J.F.: Practical bilevel optimization: algorithms and applications. Nonconvex optimization and its applications. Kluwer, Dordrecht (1998)"},{"key":"189_CR3","unstructured":"Beheshti, B.: Test instances for nonlinear bilevel knapsack problem. Available at http:\/\/www.pitt.edu\/~droleg\/files\/NBKP.html . Accessed on 31 March 2014"},{"issue":"1","key":"189_CR4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0166-218X(97)00080-2","volume":"81","author":"C Blair","year":"1998","unstructured":"Blair, C.: Sensitivity analysis for knapsack problems: a negative result. Discrete Appl. Math. 81(1), 133\u2013139 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"189_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Appl. Math. 123(1), 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"key":"189_CR6","doi-asserted-by":"crossref","unstructured":"Brotcorne, L., Hanafi, S., Mansi, R.: One-level reformulation of the bilevel knapsack problem using dynamic programming. Discrete Optim. 10(1), 1\u201310 (2013)","DOI":"10.1016\/j.disopt.2012.09.001"},{"issue":"3","key":"189_CR7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.orl.2009.01.007","volume":"37","author":"L Brotcorne","year":"2009","unstructured":"Brotcorne, L., Hanafi, S., Mansi, R.: A dynamic programming algorithm for the bilevel knapsack problem. Ope. Res. Lett. 37(3), 215\u2013218 (2009)","journal-title":"Ope. Res. Lett."},{"key":"189_CR8","doi-asserted-by":"crossref","unstructured":"Caprara, A., Carvalho, M., Lodi, A., Woeginger, G.J.: A complexity and approximability study of the bilevel knapsack problem. In: Integer programming and combinatorial optimization, pp. 98\u2013109. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36694-9_9"},{"issue":"8","key":"189_CR9","doi-asserted-by":"crossref","first-page":"B-462","DOI":"10.1287\/mnsc.17.8.B462","volume":"17","author":"RG Cassidy","year":"1971","unstructured":"Cassidy, R.G., Kirby, M.J.L., Raike, W.M.: Efficient distribution of resources through three levels of government. Manag. Sci. 17(8), B-462\u2013B-473 (1971)","journal-title":"Manag. Sci."},{"key":"189_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1057\/palgrave.rpm.5170046","volume":"2","author":"J-P C\u00f4t\u00e9","year":"2003","unstructured":"C\u00f4t\u00e9, J.-P., Savard, G.: A bilevel modeling approach to pricing and fare optimization in the airline industry. J. Revenue Pricing Manag. 2, 23\u201326 (2003)","journal-title":"J. Revenue Pricing Manag."},{"issue":"4","key":"189_CR11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.trb.2004.05.001","volume":"39","author":"S-W Chiou","year":"2005","unstructured":"Chiou, S.-W.: Bilevel programming for the continuous transport network design problem. Transp. Res. Part B 39(4), 361\u2013383 (2005)","journal-title":"Transp. Res. Part B"},{"issue":"1","key":"189_CR12","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. Ann. Oper. Res. 153(1), 235\u2013256 (2007)","journal-title":"Ann. Oper. Res."},{"key":"189_CR13","volume-title":"Foundations of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Kluwer, Dordrecht (2002)"},{"issue":"2","key":"189_CR14","first-page":"93","volume":"8","author":"S Dempe","year":"2000","unstructured":"Dempe, S., Richter, K.: Bilevel programming with knapsack constraints. CEJOR 8(2), 93\u2013107 (2000)","journal-title":"CEJOR"},{"key":"189_CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-1-4613-0307-7_6","volume-title":"Multilevel Optimization: Algorithms and Applications","author":"X Deng","year":"1998","unstructured":"Deng, X.: Complexity issues in bilevel linear programming. In: Migdalas, A., Pardalos, P.M., Varbrand, P. (eds.) Multilevel Optimization: Algorithms and Applications, pp. 149\u2013164. Kluwer, Dordrecht (1998)"},{"key":"189_CR16","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","volume":"12","author":"G Gallo","year":"1980","unstructured":"Gallo, G., Hammer, P.L., Simeone, B.: Quadratic knapsack problems. Math. Program. 12, 132\u2013149 (1980)","journal-title":"Math. Program."},{"key":"189_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)"},{"issue":"1","key":"189_CR18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01582890","volume":"52","author":"P Hansen","year":"1991","unstructured":"Hansen, P., Poggi de Arag\u00e3o, M.V., Ribeiro, C.C.: Hyperbolic 0\u20131 programming and query optimization in information retrieval. Math. Program. 52(1), 255\u2013263 (1991)","journal-title":"Math. Program."},{"issue":"6","key":"189_CR19","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1007\/s11590-011-0412-1","volume":"6","author":"S Ke\u00e7ici","year":"2012","unstructured":"Ke\u00e7ici, S., Aras, N., Verter, V.: Incorporating the threat of terrorist attacks in the design of public service facility networks. Optim. Lett. 6(6), 1101\u20131121 (2012)","journal-title":"Optim. Lett."},{"key":"189_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"issue":"2","key":"189_CR21","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-006-0711-y","volume":"108","author":"N Kong","year":"2006","unstructured":"Kong, N., Schaefer, A.J., Hunsaker, B.: Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach. Math. Program. 108(2), 275\u2013296 (2006)","journal-title":"Math. Program."},{"key":"189_CR22","doi-asserted-by":"crossref","unstructured":"Mansi, R., Alves, C., Val\u00e9rio de Carvalho, J.M. Hanafi, S.: An exact algorithm for bilevel 0\u20131 knapsack problems. Math. Probl. Eng. (2012) http:\/\/www.hindawi.com\/journals\/mpe\/2012\/504713\/abs\/","DOI":"10.1155\/2012\/504713"},{"issue":"7","key":"189_CR23","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1051\/mmnp\/20105719","volume":"5","author":"R Mansi","year":"2010","unstructured":"Mansi, R., Hanafi, S., Brotcorne, L.: Integer programming formulation of the bilevel knapsack problem. Math. Model. Nat. Phenom. 5(7), 116\u2013121 (2010)","journal-title":"Math. Model. Nat. Phenom."},{"key":"189_CR24","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)"},{"key":"189_CR25","doi-asserted-by":"crossref","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.M., V\u00e4rbrand, P.: Multilevel Optimization: Algorithms and Applications. Kluwer, Dordrecht (1998)"},{"issue":"4","key":"189_CR26","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/j.orl.2010.04.005","volume":"38","author":"OY \u00d6zalt\u0131n","year":"2010","unstructured":"\u00d6zalt\u0131n, O.Y., Prokopyev, O.A., Schaefer, A.J.: The bilevel knapsack problem with stochastic right-hand sides. Oper. Res. Lett. 38(4), 328\u2013333 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"189_CR27","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10107-010-0412-4","volume":"133","author":"OY \u00d6zalt\u0131n","year":"2012","unstructured":"\u00d6zalt\u0131n, O.Y., Prokopyev, O.A., Schaefer, A.J.: Two-stage quadratic integer programs with stochastic right-hand sides. Math. Program. 133(1\u20132), 121\u2013158 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"189_CR28","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(92)90043-3","volume":"11","author":"PM Pardalos","year":"1992","unstructured":"Pardalos, P.M., Jha, S.: Complexity of uniqueness and local search in quadratic 0\u20131 programming. Oper. Res. Lett. 11(2), 119\u2013123 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"189_CR29","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","volume":"7","author":"PM Pardalos","year":"1988","unstructured":"Pardalos, P.M., Schnitger, G.: Checking local optimality in constrained quadratic programming is NP-hard. Oper. Res. Lett. 7(1), 33\u201335 (1988)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"189_CR30","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem\u2014a survey. Discrete Appl. Math. 155(5), 623\u2013648 (2007)","journal-title":"Discrete Appl. Math."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0189-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0189-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0189-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T22:25:36Z","timestamp":1565389536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0189-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,3]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["189"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0189-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,3]]}}}