{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:36Z","timestamp":1725796596404},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_27","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"312-323","source":"Crossref","is-referenced-by-count":0,"title":["Improved Approximation Algorithms for a Bilevel Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Xian","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Kern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","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. Operation Research Letters\u00a037(3), 215\u2013218 (2009)","journal-title":"Operation Research Letters"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-36694-9_9","volume-title":"Integer Programming and Combinatorial Optimization","author":"A. Caprara","year":"2013","unstructured":"Caprara, A., Carvalho, M., Lodi, A., Woeginger, G.J.: A complexity and approximability study of the bilevel knapsack problem. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol.\u00a07801, pp. 98\u2013109. Springer, Heidelberg (2013)"},{"key":"27_CR3","first-page":"213","volume-title":"Proceedings of SODA 2000","author":"C. Chekuri","year":"2000","unstructured":"Chekuri, C., Khanna, S.: A ptas for the multiple knapsack problem. In: Proceedings of SODA 2000, pp. 213\u2013222. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-22616-8_31","volume-title":"Combinatorial Optimization and Applications","author":"L. Chen","year":"2011","unstructured":"Chen, L., Zhang, G.: Approximation algorithms for a bi-level knapsack problem. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol.\u00a06831, pp. 399\u2013410. Springer, Heidelberg (2011)"},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10288-005-0071-0","volume":"3","author":"B. Colson","year":"2005","unstructured":"Colson, B., Marcotte, P., Savard, G.: Bilevel programming: A survey. 4OR: A Quarterly Journal of Operations Research\u00a03(2), 87\u2013107 (2005)","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"27_CR6","volume-title":"Foundations of Bilevel Programming","author":"S. Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"27_CR7","first-page":"93","volume":"8","author":"S. Dempe","year":"2000","unstructured":"Dempe, S., Richter, K.: Bilevel programming with knapsack constraints. Central European Journal of Operation Research\u00a08, 93\u2013107 (2000)","journal-title":"Central European Journal of Operation Research"},{"key":"27_CR8","unstructured":"DeNegre, S.: Interdiction and discrete bilevel linear programming. PhD thesis, Bethlehem, PA, USA (2011), AAI3456385."},{"key":"27_CR9","doi-asserted-by":"publisher","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: Multilevel Optimization: Algorithms and Applications, pp. 149\u2013164. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"4","key":"27_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O.H. Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM\u00a022(4), 463\u2013468 (1975)","journal-title":"Journal of the ACM"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of STOC 2002, pp. 731\u2013740 (2002)","DOI":"10.1145\/510008.510012"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF00121269","volume":"8","author":"P. Loridan","year":"1996","unstructured":"Loridan, P., Morgan, J.: Weak via strong stackelberg problem: New results. Journal of Global Optimization\u00a08(3), 263\u2013287 (1996)","journal-title":"Journal of Global Optimization"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Mansi, R., Alves, C., de Carvalho, J., Hanafi, S.: An exact algorithm for bilevel 0-1 knapsack problems. Mathematical Problems in Engineering, Article ID 504713 (2012)","DOI":"10.1155\/2012\/504713"},{"key":"27_CR14","doi-asserted-by":"publisher","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 Academic Publishers, Dordrecht (1998)"},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/321864.321873","volume":"22","author":"S. Sahni","year":"1975","unstructured":"Sahni, S.: Approximate algorithms for the 0\/1 knapsack problem. Journal of the ACM\u00a022(1), 115\u2013124 (1975)","journal-title":"Journal of the ACM"},{"key":"27_CR16","volume-title":"Approximation algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation algorithms. Springer-Verlag New York, Inc., New York (2001)"},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"847","DOI":"10.3934\/jimo.2010.6.847","volume":"6","author":"Z. Wang","year":"2010","unstructured":"Wang, Z., Xing, W.: Two-person knapsack game. Journal of Industrial and Management Optimization\u00a06(4), 847\u2013860 (2010)","journal-title":"Journal of Industrial and Management Optimization"},{"issue":"7-9","key":"27_CR18","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1016\/j.tcs.2009.12.002","volume":"411","author":"Z. Wang","year":"2010","unstructured":"Wang, Z., Xing, W., Fang, S.-C.: Two-group knapsack game. Theoretical Computer Science\u00a0411(7-9), 1094\u20131103 (2010)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T07:07:49Z","timestamp":1558940869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}