{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T15:27:14Z","timestamp":1666366034271},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10898-013-0094-6","type":"journal-article","created":{"date-parts":[[2013,8,10]],"date-time":"2013-08-10T06:00:05Z","timestamp":1376114405000},"page":"461-480","source":"Crossref","is-referenced-by-count":7,"title":["A variable neighborhood search algorithm for the multimode set covering problem"],"prefix":"10.1007","volume":"63","author":[{"given":"Fabio","family":"Colombo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Cordone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guglielmo","family":"Lulli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"issue":"3","key":"94_CR1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<139::AID-JOS41>3.0.CO;2-2","volume":"3","author":"U Aickelin","year":"2000","unstructured":"Aickelin, U., Dowsland, K.A.: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. J. Sched. 3(3), 139\u2013153 (2000)","journal-title":"J. Sched."},{"issue":"1","key":"94_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1049\/iet-wss.2011.0085","volume":"2","author":"M Ashouri","year":"2012","unstructured":"Ashouri, M., Zali, Z., Mousavi, S.R., Hashemi, M.R.: New optimal solution to disjoint set K-coverage for lifetime extension in wireless sensor networks. IET Wirel. Sens. Syst. 2(1), 31\u201339 (2012)","journal-title":"IET Wirel. Sens. Syst."},{"key":"94_CR3","doi-asserted-by":"crossref","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 problems. Eur. J. Oper. Res. 31, 85\u201393 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"6\u20137","key":"94_CR4","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1016\/j.dam.2004.11.009","volume":"155","author":"P Berman","year":"2007","unstructured":"Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene network. Discret. Appl. Math. 155(6\u20137), 733\u2013749 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"94_CR5","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.csi.2012.11.001","volume":"35","author":"K Bicakci","year":"2013","unstructured":"Bicakci, K., Bagci, I.E., Tavli, B., Pala, Z.: Neighbor sensor networks: increasing lifetime and eliminating partitioning through cooperation. Comput. Stand. Interfaces 35(4), 396\u2013402 (2013)","journal-title":"Comput. Stand. Interfaces"},{"key":"94_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0167-8191(00)00092-2","volume":"27","author":"T Chen","year":"2001","unstructured":"Chen, T., Filkov, V., Skiena, S.S.: Identifying gene regulatory networks from experimental data. Parallel Comput. 27, 141\u2013162 (2001)","journal-title":"Parallel Comput."},{"key":"94_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set covering problem. Math. Oper. Res. 4, 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"4\u20135","key":"94_CR8","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1016\/j.dam.2012.02.010","volume":"61","author":"R Cordone","year":"2013","unstructured":"Cordone, R., Lulli, G.: An integer optimization approach for reverse engineering of gene regulatory networks. Discret. Appl. Math. 61(4\u20135), 580\u2013592 (2013)","journal-title":"Discret. Appl. Math."},{"key":"94_CR9","doi-asserted-by":"crossref","unstructured":"Cordone, R., Lulli, G.: A GRASP metaheuristic for microarray data analysis. Comput. Oper. Res. (in press), (2012). doi:\u00a0 10.1016\/j.cor.2012.10.008","DOI":"10.1016\/j.cor.2012.10.008"},{"key":"94_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"key":"94_CR11","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, New York (1979)"},{"key":"94_CR12","unstructured":"Gent, I.P., Walsh, T.: Towards an understanding of hill-climbing procedures for SAT. In: Proceedings of the 11th National Conference on, Artificial Intelligence (AAAI\u201993), pp. 28\u201333 (1993)"},{"key":"94_CR13","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u00e7, N., Moreno P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"94_CR14","doi-asserted-by":"crossref","unstructured":"Hua, Q.-S., Yu, D., Lau, F.C.M., Wang, Y.: Exact algorithms for set multicover and multiset multicover problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (Eds.) Proceedings of ISAAC Conference 2009, LNCS, vol. 5878, pp. 34\u201344 (2009)","DOI":"10.1007\/978-3-642-10631-6_6"},{"key":"94_CR15","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"94_CR16","doi-asserted-by":"crossref","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, 1387\u20131403 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"94_CR17","doi-asserted-by":"crossref","first-page":"2469","DOI":"10.1016\/j.dam.2008.06.044","volume":"157","author":"G Lulli","year":"2009","unstructured":"Lulli, G., Romauch, M.: A mathematical program to refine gene regulatory networks. Discret. Appl. Math. 157, 2469\u20132482 (2009)","journal-title":"Discret. Appl. Math."},{"key":"94_CR18","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.C.: Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12, 164\u2013176 (2000)","journal-title":"INFORMS J. Comput."},{"key":"94_CR19","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1137\/S0097539703434620","volume":"36","author":"A Srinivasan","year":"2006","unstructured":"Srinivasan, A.: An extension of the Lov\u00e1sz local lemma, and its applications to integer programming. SIAM J. Comput. 36, 609\u2013634 (2006)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"94_CR20","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/43.644030","volume":"16","author":"T Villa","year":"1997","unstructured":"Villa, T., Kam, T., Brayton, R.K., Sangiovanni-Vincentelli, A.L.: Explicit and implicit algorithms for binate covering problems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(7), 677\u2013691 (1997)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"94_CR21","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics 1, 80\u201383 (1945)","journal-title":"Biometrics"},{"issue":"2","key":"94_CR22","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.ejor.2004.10.018","volume":"172","author":"M Yagiura","year":"2006","unstructured":"Yagiura, M., Kishida, M., Ibaraki, T.: A 3-flip neighborhood local search for the set covering problem. Eur. J. Oper. Res. 172(2), 472\u2013499 (2006)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0094-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0094-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0094-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:05Z","timestamp":1559278745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0094-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["94"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0094-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,11]]}}}