{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:41Z","timestamp":1725487061637},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434320"},{"type":"electronic","value":"9783540460046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46004-7_7","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T21:43:59Z","timestamp":1183412639000},"page":"61-71","source":"Crossref","is-referenced-by-count":9,"title":["Exploiting Fitness Distance Correlation of Set Covering Problems"],"prefix":"10.1007","author":[{"given":"Markus","family":"Finger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helena","family":"Louren\u00e7o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/inte.27.5.68","volume":"27","author":"E. Housos","year":"1997","unstructured":"E. Housos and T. Elmoth. Automatic optimization of subproblems in scheduling airlines crews. Interfaces, 27(5):68\u201377, 1997.","journal-title":"Interfaces"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/trsc.35.3.331.10147","volume":"35","author":"H. Louren\u00e7o","year":"2001","unstructured":"H. Louren\u00e7o, R. Portugal, and J.P. Paix ao. Multiobjective metaheuristics for the bus-driver scheduling problem. Transportation Science, 35(3):331\u2013343, 2001.","journal-title":"Transportation Science"},{"key":"7_CR3","first-page":"115","volume":"15","author":"F.J. Vasko","year":"1988","unstructured":"F.J. Vasko and F.E. Wolf. Optimal selection of ingot sizes via set covering. Operations Research, 15:115\u2013121, 1988.","journal-title":"Operations Research"},{"key":"7_CR4","unstructured":"A. Caprara, M. Fischetti, and P. Toth. Algorithms for the set covering problem. Technical Report OR-98-3, DEIS, University of Bologna, Italy, 1998."},{"key":"7_CR5","first-page":"215","volume":"81","author":"S. Ceria","year":"1998","unstructured":"S. Ceria, P. Nobili, and A. Sassano. A lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming, 81:215\u2013228, 1998.","journal-title":"Mathematical Programming"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A. Caprara","year":"1999","unstructured":"A. Caprara, M. Fischetti, and P. Toth. A heuristic method for the set covering problem. Operations Research, 47:730\u2013743, 1999.","journal-title":"Operations Research"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J.E. Beasley","year":"1996","unstructured":"J.E. Beasley and P.C. Chu. A genetic algorithm for the set covering problem. European Journal of Operational Research, 94:392\u2013404, 1996.","journal-title":"European Journal of Operational Research"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"A.V. Eremeev. A genetic algorithm with a non-binary representation for the set covering problem. In Proceedings of OR\u201998, pages 175\u2013181. Springer Verlag, 1999.","DOI":"10.1007\/978-3-642-58409-1_17"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"M.J. Brusco","year":"1999","unstructured":"M.J. Brusco, L.W. Jacobs, and G.M. Thompson. A morphing procedure to supplement a simulated annealing heuristic for cost-and coverage-corrleated set covering problems. Annals of Operations Research, 86:611\u2013627, 1999.","journal-title":"Annals of Operations Research"},{"key":"7_CR10","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2002","unstructured":"H.R. Louren\u00e7o, O. Martin, and T. St\u00fctzle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics. Kluwer Academic Publishers, Boston, MA, USA, 2002. to appear."},{"key":"7_CR11","series-title":"Lect Notes Comput Sci","first-page":"367","volume-title":"Real World Applications of Evolutionary Computing","author":"E. Marchiori","year":"2000","unstructured":"E. Marchiori and A. Steenbeek. An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. In Real World Applications of Evolutionary Computing, volume 1083 of Lecture Notes in Computer Science, pages 367\u2013381. Springer Verlag, Berlin, Germany, 2000."},{"key":"7_CR12","unstructured":"M. Kishida M. Yagiura and T. Ibaraki. A 3-flip neighborhood local search for the set covering problem. submitted for publication, 2001."},{"key":"7_CR13","unstructured":"T. Jones and S. Forrest. Fitness distance correlation as a measure of problem dificulty for genetic algorithms. In L.J. Eshelman, editor, Proc. of the 6th Int. Conf. on Genetic Algorithms, pages 184\u2013192. Morgan Kaufman, 1995."},{"key":"7_CR14","unstructured":"P.F. Stadler. Towards a theory of landscapes. Technical Report Technical Report SFI-95-03-030, Santa Fe Institute, 1995."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E.D. Weinberger","year":"1990","unstructured":"E.D. Weinberger. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics, 63:325\u2013336, 1990.","journal-title":"Biological Cybernetics"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K.D. Boese","year":"1994","unstructured":"K.D. Boese, A.B. Kahng, and S. Muddu. A New Adaptive Multi-Start Technique for Combinatorial Global Optimization. Operations Research Letters, 16:101\u2013113, 1994.","journal-title":"Operations Research Letters"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E. Balas","year":"1996","unstructured":"E. Balas and M.C. Carrera. A dynamic subgradient-based branch and bound procedure for set covering. Operations Research, 44:875\u2013890, 1996.","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46004-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T11:56:11Z","timestamp":1550404571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46004-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434320","9783540460046"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-46004-7_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}