{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:05:54Z","timestamp":1649113554481},"reference-count":25,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0305-0548(97)00084-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:08:45Z","timestamp":1027598925000},"page":"441-455","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid heuristic algorithms for Set Covering"],"prefix":"10.1016","volume":"25","author":[{"given":"Angelo","family":"Monfroglio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00084-1_BIB1","unstructured":"Garey, M. R. and Johnson, D. S., Computer and Intractability, Freeman, San Francisco, 1979"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB2","unstructured":"Jordan, M., Attractor dynamics and parallelism in a connectionist sequential machine. In Proc. 8th Annual Conf. on Cognition Science Society. 1986, pp. 531\u2013546"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB3","unstructured":"Salkin, H. M. and Mathur, K., Foundations of Integer Programming. North-Holland, Amsterdam, 1989"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB4","first-page":"37","article-title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study","volume":"12","author":"Balas","year":"1980","journal-title":"Mathematica Programming"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","article-title":"An algorithm for the set covering problem","volume":"31","author":"Beasley","year":"1987","journal-title":"EJOR"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB6","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1287\/mnsc.21.5.591","article-title":"A computational survey of methods for the set covering problem","volume":"21","author":"Christofides","year":"1975","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB7","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","article-title":"Optimal solution of the set covering\/partitioning problems using dual heuristics","volume":"36","author":"Fisher","year":"1990","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB8","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1057\/jors.1985.110","article-title":"Linear programming applications on microcomputers","volume":"36","author":"McKay","year":"1985","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1002\/nav.3800310118","article-title":"An efficient heuristic for large set covering problems","volume":"31","author":"Vasko","year":"1984","journal-title":"Naval Research Logistics Quaterly"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB10","unstructured":"Nemhauser, G. L., Rinnoy, Kan A. H. G. and Todd, M. J., Optimization. North-Holland, Amsterdam, 1989"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB11","unstructured":"Hogg, T. and Williams, C. P., Solving the really hard problems with cooperative search. In Proceedings AAAI-93. Washington, DC, 1993, pp. 231\u2013236"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB12","unstructured":"Minton, S., Johnston, M. D., Philips, A. B. and Laird, P., Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proceedings AAAI-90. Boston, 1990, pp. 17\u201324"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0167-9236(94)90076-0","article-title":"Logic decisions under constraints","volume":"11","author":"Monfroglio","year":"1994","journal-title":"Decision Support Systems"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB14","first-page":"31","article-title":"Linear programs for constraint satisfaction problems","volume":"97 No. 1","author":"Zimmermann","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB15","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1002\/(SICI)1097-024X(199607)26:7<851::AID-SPE38>3.0.CO;2-A","article-title":"Hybrid genetic algorithms for a rostering problem","volume":"26","author":"Monfroglio","year":"1996","journal-title":"Software-Practice and Experience"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB16","unstructured":"Cichocki, A. and Unbehauen, R., Neural Networks for Optimization and Signal Processing, Wiley, 1993"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0925-2312(94)00005-0","article-title":"Connectionist networks for pivot selection in linear programming","volume":"8","author":"Monfroglio","year":"1995","journal-title":"Neurocomputing"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1207\/s15516709cog1402_1","article-title":"Finding structure in time","volume":"14","author":"Elman","year":"1990","journal-title":"Cognitive Science"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(93)90173-7","article-title":"A modified greedy heuristic for the set covering problem with improved worst case bound","volume":"48","author":"Goldschmidt","year":"1993","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB20","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0377-2217(94)90401-4","article-title":"A surrogate heuristic for set covering problems","volume":"79","author":"Lorena","year":"1994","journal-title":"EJOR"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB21","unstructured":"Monfroglio, A., Hybrid genetic algorithms for constraint satisfaction. In Proceedings A.I.C.A. Conference. Turin, Italy, 1992, pp. 803\u2013820"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB22","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","article-title":"A genetic algorithm for the set covering problem","volume":"94","author":"Beasley","year":"1996","journal-title":"EJOR"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB23","doi-asserted-by":"crossref","unstructured":"Caprara, A., Fischetti, M. and Toth, P., A heuristic algorithm for set covering problems arising in railway applications, Ricerca operativa A.I.R.O., FrancoAngeli XXV, Milano, n. 75 1996","DOI":"10.1007\/978-3-642-80117-4_9"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB24","unstructured":"NeuralWare, Neurocomputing, NeuralWorks Pro II\/Plus v. 5.2, NeuralWare, Inc., Pittsburgh, USA, 1996"},{"key":"10.1016\/S0305-0548(97)00084-1_BIB25","unstructured":"Werbos, P. J., The Roots of Backpropagation, John Wiley & Sons, 1994"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000841?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T09:43:34Z","timestamp":1578476614000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0305054897000841"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00084-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}