{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:49:44Z","timestamp":1752461384945},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613107"},{"type":"electronic","value":"9783540684534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:28:18Z","timestamp":1330291698000},"page":"72-84","source":"Crossref","is-referenced-by-count":19,"title":["A heuristic algorithm for the set covering problem"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Fischetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"E. Balas and M. C. Carrera, \u201cA Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering\u201d, Management Sciences Research Report No. MSSR 568(R), GSIA, Carnegie-Mellon University, October 1991, revised May 1995.","DOI":"10.21236\/ADA257416"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","volume":"12","author":"E. Balas","year":"1980","unstructured":"E. Balas and A. Ho, \u201cSet Covering Algorithms Using Cutting Planes, Heuristics and Subgradient Optimization: A Computational Study\u201d, Mathematical Programming Study 12 (1980) 37\u201360.","journal-title":"Mathematical Programming Study"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"J.E. Beasley","year":"1990","unstructured":"J.E. Beasley, \u201cA Lagrangian Heuristic for Set Covering Problems\u201d, Naval Research Logistics 37 (1990) 151\u2013164.","journal-title":"Naval Research Logistics"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"J.E. Beasley, \u201cOR-Library: Distributing Test Problems by Electronic Mail\u201d, Journal of the Operational Research Society 41 (1990) 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"key":"6_CR5","volume-title":"A Genetic Algorithm for the Set Covering Problem","author":"J.E. Beasley","year":"1994","unstructured":"J.E. Beasley and P.C. Chu, \u201cA Genetic Algorithm for the Set Covering Problem\u201d, Working Paper, The Management School, Imperial College, London, July 1994."},{"key":"6_CR6","unstructured":"S. Ceria, P. Nobili, and A. Sassano, \u201cA Lagrangian-Based Heuristic for Large-Scale Set Covering Problems\u201d, Working Paper, University of Roma La Sapienza, June 1995."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"J.J. Dongarra, \u201cPerformance of Various Computers Using Standard Linear Equations Software\u201d, Technical Report No. CS-89-85, Computer Science Department, University of Tennessee, November 1993.","DOI":"10.2528\/PIER91010101"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"M.L. Fisher","year":"1990","unstructured":"M.L. Fisher and P. Kedia, \u201cOptimal Solutions of Set Covering\/Partitioning Problems Using Dual Heuristics\u201d, Management Science 36 (1990) 674\u2013688.","journal-title":"Management Science"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"M. Held and R.M. Karp, \u201cThe Traveling Salesman Problem and Minimum Spanning Trees: Part II\u201d, Mathematical Programming 1 (1971) 6\u201325.","journal-title":"Mathematical Programming"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0377-2217(94)90401-4","volume":"79","author":"L.A.N. Lorena","year":"1994","unstructured":"L.A.N. Lorena and F.B. Lopes, \u201cA Surrogate Heuristic for Set Covering Problems\u201d, European Journal of Operational Research 79 (1994) 138\u2013150.","journal-title":"European Journal of Operational Research"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"D. Wedelin, \u201cAn Algorithm for Large Scale 0-1 Integer Programming with Application to Airline Crew Scheduling\u201d, Annals of Operational Research (to appear) (1995).","DOI":"10.1007\/BF02099703"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T19:09:45Z","timestamp":1687288185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}