{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:06:39Z","timestamp":1725541599863},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040443"},{"type":"electronic","value":"9783642040450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-04045-0_32","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T10:09:00Z","timestamp":1259748540000},"page":"379-389","source":"Crossref","is-referenced-by-count":3,"title":["Computing and Selecting \u03b5-Efficient Solutions of {0, 1}-Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Emilia","family":"Tantar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Sch\u00fctze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Rui","family":"Figueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos A. Coello","family":"Coello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"El-Ghazali","family":"Talbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,21]]},"reference":[{"issue":"2","key":"32_CR1_32","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1023\/A:1015579208736","volume":"23","author":"R. Blanquero","year":"2002","unstructured":"Blanquero, R. & Carrizosa, E. (2002). A d.c. biobjective location model. Journal of Global Optimization, 23(2), 569\u2013580.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"32_CR2_32","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1162\/106365605774666895","volume":"13","author":"K Deb","year":"2005","unstructured":"Deb, K., Mohan, M., & Mishra, S. (2005). Evaluating the \u03b5-domination based multi-objective evolutionary algorithm for a quick computation of pareto-optimal solutions. Evolutionary Computation, 13(4), 501\u2013525.","journal-title":"Evolutionary Computation"},{"issue":"3","key":"32_CR3_32","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1016\/j.ejor.2005.10.023","volume":"177","author":"A Engau","year":"2007","unstructured":"Engau, A. & Wiecek, M. (2007). Generating epsilon-efficient solutions in multiobjective programming. European Journal of Operational Research, 177(3), 1566\u20131579.","journal-title":"European Journal of Operational Research"},{"key":"32_CR4_32","unstructured":"Grosan, C. (2006). Multiobjective 0\/1 knapsack problem using adaptive epsilon -dominance. In Proceedings of 9th World on-line Conference on Soft Computing in Industrial Application (pp. 551\u2013562). Springer."},{"key":"32_CR5_32","unstructured":"Iosifescu, M. (1980). Finite Markov Processes and Their Applications. Wiley."},{"key":"32_CR6_32","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0377-2217(02)00080-2","volume":"140","author":"L Jenkins","year":"2002","unstructured":"Jenkins, L. (2002). A bicreteria knapsack program for planning remediation of contaminated lightstation sites. European Journal of Operational Research, 140, 427\u2013433.","journal-title":"European Journal of Operational Research"},{"key":"32_CR7_32","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0898-1221(99)00065-6","volume":"37","author":"MM Kostreva","year":"1999","unstructured":"Kostreva, M. M., Ogryczak, W., & Tonkyn, D. W. (1999). Relocation problems arising in conservation biology. Computers and Mathematics with Applications, 37, 135\u2013150.","journal-title":"Computers and Mathematics with Applications"},{"issue":"1","key":"32_CR8_32","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/B:NACO.0000023415.22052.55","volume":"3","author":"M Laumanns","year":"2004","unstructured":"Laumanns, M., Thiele, L., & Zitzler, E. (2004). Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem. Natural Computing: an international journal, 3(1), 37\u201351.","journal-title":"Natural Computing: an international journal"},{"key":"32_CR9_32","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF00936165","volume":"43","author":"P Loridan","year":"1984","unstructured":"Loridan, P. (1984). \u03b5-solutions in vector minimization problems. Journal of Optimization Theory and Applications, 43, 265\u2013276.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"32_CR10_32","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1287\/opre.37.3.384","volume":"37","author":"M Rosenblatt","year":"1989","unstructured":"Rosenblatt, M. & Sinunany-Stern, Z. (1989). Generating the discrete efficient frontier to the capital budgeting problem. Operations Research, 37, 384\u2013394.","journal-title":"Operations Research"},{"key":"32_CR11_32","doi-asserted-by":"crossref","unstructured":"Rudolph, G. & Agapie, A. (2000). Convergence properties of some multi-objective evolutionary algorithms. In Proceedings of the 2000 Conference on Evolutionary Computation (CEC2000) (pp. 1010\u20131016). IEEE.","DOI":"10.1109\/CEC.2000.870756"},{"key":"32_CR12_32","unstructured":"Sch\u00fctze, O., Coello Coello, C. A., & Talbi, E.-G. (2007). Approximating the \u03b5-efficient set of an MOP with stochastic search algorithms. In A. Gelbukh & A. Kuri Morales (Eds.), MICAI 2007: Advances in Artificial Intelligence, (Vol. 4827) of Lecture Notes in Computer Science (pp. 128\u2013138). Berlin\/Heidelberg: Springer."},{"key":"32_CR13_32","unstructured":"Sch\u00fctze, O., Coello Coello, C. A., Tantar, E., & Talbi, E.-G. (2008). Computing finite size representations of the set of approximate solutions of an mop with stochastic search algorithms. In GECCO \u201908: Proceedings of the 10th annual conference on Genetic and evolutionary computation (pp. 713\u2013720). ACM."},{"issue":"4","key":"32_CR14_32","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10898-007-9265-7","volume":"41","author":"O Sch\u00fctze","year":"2008","unstructured":"Sch\u00fctze, O., Laumanns, M., Coello Coello, C. A., Dellnitz, M., & Talbi, E.-G. (2008). Convergence of stochastic search algorithms to finite size Pareto set approximations. Journal of Global Optimization, 41(4), 559\u2013577.","journal-title":"Journal of Global Optimization"},{"key":"32_CR15_32","unstructured":"Sch\u00fctze, O., Laumanns, M., Tantar, E., Coello Coello, C., & Talbi, E.-G. (2009). Computing gap free Pareto front approximations with stochastic search algorithms. To appear in Evolutionary Computation."},{"key":"32_CR16_32","unstructured":"Tantar, E. (2009). Landscape analysis in multi-objective combinatorial optimization. Ph.D. thesis, Universit\u00e9 des Sciences et Technologies de Lille, Villeneuve d\u00b4Ascq, France."},{"issue":"2","key":"32_CR17_32","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00940762","volume":"49","author":"D White","year":"1986","unstructured":"White, D. (1986). Epsilon efficiency. Journal of Optimization Theory and Applications, 49(2), 319\u2013337.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"4","key":"32_CR18_32","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E. & Thiele, L. (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation, 3(4), 257\u2013271.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Economics and Mathematical Systems","Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04045-0_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:38:19Z","timestamp":1606185499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04045-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,21]]},"ISBN":["9783642040443","9783642040450"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04045-0_32","relation":{},"ISSN":["0075-8442"],"issn-type":[{"type":"print","value":"0075-8442"}],"subject":[],"published":{"date-parts":[[2009,10,21]]}}}