{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T08:11:58Z","timestamp":1745309518863},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319336237"},{"type":"electronic","value":"9783319336251"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33625-1_35","type":"book-chapter","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T10:42:39Z","timestamp":1461148959000},"page":"395-402","source":"Crossref","is-referenced-by-count":2,"title":["A Beam-Search Approach to the Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Victor","family":"Reyes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio","family":"Araya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,21]]},"reference":[{"key":"35_CR1","unstructured":"Balas, E., et al.: A class of location, distribution and scheduling problems: modeling and solution methods (1982)"},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"JE Beasley","year":"1987","unstructured":"Beasley, J.E.: An algorithm for set covering problem. Eur. J. Oper. Res. 31(1), 85\u201393 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"35_CR3","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"35_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10732-008-9095-x","volume":"16","author":"JA Bennell","year":"2010","unstructured":"Bennell, J.A., Song, X.: A beam search implementation for the irregular shape packing problem. J. Heuristics 16(2), 167\u2013188 (2010)","journal-title":"J. Heuristics"},{"issue":"6","key":"35_CR5","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum, C.: Beam-acohybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput. Oper. Res. 32(6), 1565\u20131591 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20134","key":"35_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98(1\u20134), 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"35_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01581106","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria, S., Nobili, P., Sassano, A.: A lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81(2), 215\u2013228 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"35_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"35_CR9","unstructured":"Michael, R.G., David, S.J.: Computers and intractability: a guide to the theory of np-completeness. San Francisco, p. 1979. Freeman, LA (1979)"},{"issue":"7","key":"35_CR10","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1057\/palgrave.jors.2601366","volume":"53","author":"M Haouari","year":"2002","unstructured":"Haouari, M, Chaouachi, J.S.: A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem. J. Oper. Res. Soc. 792\u2013799 (2002)","journal-title":"Journal of the Operational Research Society"},{"issue":"7","key":"35_CR11","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M","volume":"42","author":"LW Jacobs","year":"1995","unstructured":"Jacobs, L.W., Brusco, M.J.: Note: a local-search heuristic for large set-covering problems. Nav. Res. Logist. (NRL) 42(7), 1129\u20131140 (1995)","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"1","key":"35_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00291-003-0148-0","volume":"26","author":"KH Kim","year":"2004","unstructured":"Kim, K.H., Kang, J.S., Ryu, K.R.: A beam search algorithm for the load sequencing of outbound containers in port container terminals. OR Spectr. 26(1), 93\u2013116 (2004)","journal-title":"OR Spectr."},{"issue":"3","key":"35_CR13","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G Lan","year":"2007","unstructured":"Lan, G., DePuy, G.W., Whitehouse, G.E.: An effective and simple heuristic for the set covering problem. Eur. J. Oper. Res. 176(3), 1387\u20131403 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-28646-2_1","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"L Lessing","year":"2004","unstructured":"Lessing, L., Dumitrescu, I., St\u00fctzle, T.: A comparison between aco algorithms for the set covering problem. Ant Colony Optimization and Swarm Intelligence, pp. 1\u201312. Springer, Berlin (2004)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Norvig, P.: Paradigms of Artificial Intelligence Programming: Case Studies in Common LISP. Morgan Kaufmann (1992)","DOI":"10.1016\/B978-0-08-057115-7.50024-8"},{"issue":"3","key":"35_CR16","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/S0377-2217(00)00205-8","volume":"133","author":"M Ohlsson","year":"2001","unstructured":"Ohlsson, M., Peterson, C., S\u00f6derberg, B.: An efficient mean field approach to the set covering problem. Eur. J. Oper. Res. 133(3), 583\u2013595 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"35_CR17","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Z-G Ren","year":"2010","unstructured":"Ren, Z.-G., Feng, Z.-R., Ke, L.-J., Zhang, Z.-J.: New ideas for applying ant colony optimization to the set covering problem. Comput. Ind. Eng. 58(4), 774\u2013784 (2010)","journal-title":"Comput. Ind. Eng."},{"issue":"9","key":"35_CR18","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1016\/S0305-0548(01)00026-0","volume":"29","author":"M Solar","year":"2002","unstructured":"Solar, M., Parada, V., Urrutia, R.: A parallel genetic algorithm to solve the set-covering problem. Comput. Oper. Res. 29(9), 1221\u20131235 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"35_CR19","doi-asserted-by":"publisher","first-page":"2186","DOI":"10.1016\/j.dss.2006.06.008","volume":"42","author":"F Wang","year":"2007","unstructured":"Wang, F., Lim, A.: A stochastic beam search for the berth allocation problem. Decis. Support Syst. 42(4), 2186\u20132196 (2007)","journal-title":"Decis. Support Syst."}],"container-title":["Advances in Intelligent Systems and Computing","Artificial Intelligence Perspectives in Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33625-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T21:03:42Z","timestamp":1559423022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33625-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319336237","9783319336251"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33625-1_35","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016]]}}}