{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:10:31Z","timestamp":1743027031681,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030535513"},{"type":"electronic","value":"9783030535520"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53552-0_23","type":"book-chapter","created":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T16:50:23Z","timestamp":1595004623000},"page":"233-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Memetic Approach for the Unicost Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Pinard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Moalic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Br\u00e9villiers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Lepagnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhassane","family":"Idoumghar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"key":"23_CR1","unstructured":"Balas, E.: A class of location, distribution and scheduling problems: modeling and solution methods. In: Proceedings of the Chinese-U.S. Symposium on Systems Analysis. Wiley Series on Systems Engineering and Analysis. Wiley (1983). ISBN 978-0-471-87093-7"},{"key":"23_CR2","series-title":"Mathematical Programming Studies","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BFb0120886","volume-title":"Combinatorial Optimization","author":"E Balas","year":"1980","unstructured":"Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. In: Padberg, M.W. (ed.) Combinatorial Optimization. MATHPROGRAMM, vol. 12, pp. 37\u201360. Springer, Heidelberg (1980). \nhttps:\/\/doi.org\/10.1007\/BFb0120886\n\n. ISBN 978-3-642-00802-3"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: A Lagrangian heuristic for set-covering problems. Naval Res. Logist. 37(1), 151\u2013164 (1990). \nhttps:\/\/doi.org\/10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","journal-title":"Naval Res. Logist."},{"issue":"11","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990). \nhttps:\/\/doi.org\/10.1057\/jors.1990.166","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"J Beasley","year":"1987","unstructured":"Beasley, J.: An algorithm for set covering problem. Eur. J. Oper. Res. 31(1), 85\u201393 (1987). \nhttps:\/\/doi.org\/10.1016\/0377-2217(87)90141-X","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1111\/itor.12110","volume":"22","author":"M Boschetti","year":"2015","unstructured":"Boschetti, M., Maniezzo, V.: A set covering based matheuristic for a real-world city logistics problem. Int. Trans. Oper. Res. 22(1), 169\u2013195 (2015). \nhttps:\/\/doi.org\/10.1111\/itor.12110","journal-title":"Int. Trans. Oper. Res."},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Br\u00e9villiers, M., Lepagnot, J., Idoumghar, L., Rebai, M., Kritter, J.: Hybrid differential evolution algorithms for the optimal camera placement problem. J. Syst. Inf. Technol. (2018). \nhttps:\/\/doi.org\/10.1108\/JSIT-09-2017-0081","DOI":"10.1108\/JSIT-09-2017-0081"},{"key":"23_CR8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.5.730","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. (1999). \nhttps:\/\/doi.org\/10.1287\/opre.47.5.730","journal-title":"Oper. Res."},{"issue":"5","key":"23_CR9","doi-asserted-by":"publisher","first-page":"591","DOI":"10.2307\/2630042","volume":"21","author":"N Christofides","year":"1975","unstructured":"Christofides, N., Korman, S.: A computational survey of methods for the set covering problem. Manag. Sci. 21(5), 591\u2013599 (1975). \nhttps:\/\/doi.org\/10.2307\/2630042","journal-title":"Manag. Sci."},{"key":"23_CR10","doi-asserted-by":"publisher","unstructured":"Ding, J., L\u00fc, Z., Li, C.-M., Shen, L., Xu, L., Glover, F.: A two-individual based evolutionary algorithm for the flexible job shop scheduling problem. Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, pp. 2262\u20132271 (2019). \nhttps:\/\/doi.org\/10.1609\/aaai.v33i01.33012262","DOI":"10.1609\/aaai.v33i01.33012262"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.cie.2011.08.020","volume":"62","author":"RZ Farahani","year":"2012","unstructured":"Farahani, R.Z., Asgari, N., Heidari, N., Hosseininia, M., Goh, M.: Covering problems in facility location: a review. Comput. Ind. Eng. 62(1), 368\u2013407 (2012). \nhttps:\/\/doi.org\/10.1016\/j.cie.2011.08.020","journal-title":"Comput. Ind. Eng."},{"key":"23_CR12","series-title":"Mathematical Programming Studies","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BFb0120689","volume-title":"Approaches to Integer Programming","author":"DR Fulkerson","year":"1974","unstructured":"Fulkerson, D.R., Nemhauser, G.L., Trotter, L.E.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. In: Balinski, M.L. (ed.) Approaches to Integer Programming. MATHPROGRAMM, vol. 2, pp. 72\u201381. Springer, Heidelberg (1974). \nhttps:\/\/doi.org\/10.1007\/BFb0120689\n\n. ISBN 978-3-642-00740-8"},{"issue":"4","key":"23_CR13","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.-K.: Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim. 3(4), 379\u2013397 (1999). \nhttps:\/\/doi.org\/10.1023\/A:1009823419804","journal-title":"J. Comb. Optim."},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.ejor.2015.05.038","volume":"246","author":"C Gao","year":"2015","unstructured":"Gao, C., Yao, X., Weise, T., Li, J.: An efficient local search heuristic with row weighting for the unicost set covering problem. Eur. J. Oper. Res. 246(3), 750\u2013761 (2015). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2015.05.038","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR15","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. (1990). \nhttp:\/\/dl.acm.org\/citation.cfm?id=574848"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0377-2217(96)00161-0","volume":"101","author":"T Grossman","year":"1997","unstructured":"Grossman, T., Wool, A.: Computational experience with approximation algorithms for the set covering problem. Eur. J. Oper. Res. 101(1), 81\u201392 (1997). \nhttps:\/\/doi.org\/10.1016\/S0377-2217(96)00161-0","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345\u2013351 (1987). \nhttps:\/\/doi.org\/10.1007\/BF02239976","journal-title":"Computing"},{"key":"23_CR18","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). \nhttps:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9\n\n. ISBN 978-1-4684-2001-2"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.asoc.2018.10.025","volume":"74","author":"J Kritter","year":"2019","unstructured":"Kritter, J., Br\u00e9villiers, M., Lepagnot, J., Idoumghar, L.: On the optimal placement of cameras for surveillance and the underlying set cover problem. Appl. Soft Comput. 74, 133\u2013153 (2019). \nhttps:\/\/doi.org\/10.1016\/j.asoc.2018.10.025","journal-title":"Appl. Soft Comput."},{"key":"23_CR20","doi-asserted-by":"publisher","unstructured":"Moalic, L., Gondran, A.: The sum coloring problem: a memetic algorithm based on two individuals. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 1798\u20131805 (2019). \nhttps:\/\/doi.org\/10.1109\/CEC.2019.8789927","DOI":"10.1109\/CEC.2019.8789927"},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-017-9354-9","volume":"24","author":"L Moalic","year":"2018","unstructured":"Moalic, L., Gondran, A.: Variations on memetic algorithms for graph coloring problems. J. Heuristics 24(1), 1\u201324 (2018). \nhttps:\/\/doi.org\/10.1007\/s10732-017-9354-9","journal-title":"J. Heuristics"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"575","DOI":"10.3934\/jimo.2015.11.575","volume":"11","author":"B Yelbay","year":"2015","unstructured":"Yelbay, B., Birbil, \u015e\u0130., B\u00fclb\u00fcl, K.: The set covering problem revisited: an empirical study of the value of dual information. J. Ind. Manag. Optim. 11, 575 (2015). \nhttps:\/\/doi.org\/10.3934\/jimo.2015.11.575","journal-title":"J. Ind. Manag. Optim."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53552-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T17:00:41Z","timestamp":1595005241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53552-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030535513","9783030535520"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53552-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/LION14\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}