{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:07:40Z","timestamp":1764173260832},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1007\/bf01581106","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:36:37Z","timestamp":1114680997000},"page":"215-228","source":"Crossref","is-referenced-by-count":94,"title":["A Lagrangian-based heuristic for large-scale set covering problems"],"prefix":"10.1007","volume":"81","author":[{"given":"Sebasti\u00e1n","family":"Ceria","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Nobili","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/inte.21.1.62","volume":"21","author":"R. Anbil","year":"1991","unstructured":"R. Anbil, E. Gelman, B. Patty, R. Tanga, Recent advances in crew pairing optimization at American Airlines, Interfaces 21 (1991) 62\u201374.","journal-title":"Interfaces"},{"key":"CR2","first-page":"1","volume":"23","author":"J. Barutt","year":"1990","unstructured":"J. Barutt, T. Hull, Airline crew-scheduling: supercomputers and algorithms, SIAM News 23 (1990) 1\u20132.","journal-title":"SIAM News"},{"key":"CR3","unstructured":"D.R. Bornemann, The evolution of airline crew pairing optimization, AGIFORS Crew Management Study Group Proceedings, Paris, 1982."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/inte.19.4.29","volume":"19","author":"I. Gershkoff","year":"1989","unstructured":"I. Gershkoff, Optimizing flight crew schedules, Interfaces 19 (1989) 29\u201343.","journal-title":"Interfaces"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K.L. Hoffman","year":"1993","unstructured":"K.L. Hoffman, M. Padberg, Solving airline crew-scheduling problems by branch-and-cut, Management Science 39 (1993) 657\u2013682.","journal-title":"Management Science"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0377-2217(88)90377-3","volume":"35","author":"S. Lavoie","year":"1988","unstructured":"S. Lavoie, M. Minoux, E. Odier, A new approach for crew pairing problems by column generation with application to air transportation, European Journal of Operations Research 35 (1988) 45\u201358.","journal-title":"European Journal of Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"V. Chvatal, A greedy heuristic for the set-covering problem, Mathematics of Operations Research 4 (1979) 233\u2013235.","journal-title":"Mathematics of Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","volume":"12","author":"E. Balas","year":"1980","unstructured":"E. Balas, A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study, Mathematical Programming Study 12 (1980) 37\u201360.","journal-title":"Mathematical Programming Study"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"T.A. Feo, M.G.C. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters 8 (1989) 67\u201371.","journal-title":"Operations Research Letters"},{"key":"CR10","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, P. Kedia, Optimal solution of set covering\/partitioning problems using dual heuristics, Management Science 36 (1990) 674\u2013688.","journal-title":"Management Science"},{"key":"CR11","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, A Lagrangean heuristic for set-covering problems, Naval Research Logistics 37 (1990) 151\u2013164.","journal-title":"Naval Research Logistics"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"E. Balas, M. Carrera, A dynamic subgradient-based branch-and-bound procedure for set covering, Management Science Research Report No. 568, Carnegie Mellon University, 1992, Operations Research (to appear).","DOI":"10.21236\/ADA257416"},{"key":"CR13","volume-title":"A simulated annealing-based heuristic for the set-covering problem, Working Paper","author":"L.W. Jacobs","year":"1993","unstructured":"L.W. Jacobs, M.J. Brusco, A simulated annealing-based heuristic for the set-covering problem, Working Paper, Operations Management and Information System Department, Northern Illinois University, Dekalb, IL60115, USA, 1993."},{"key":"CR14","volume-title":"A genetic algorithm for the set covering problem, Working Paper","author":"J.E. Beasley","year":"1994","unstructured":"J.E. Beasley, P.C. Chu, A genetic algorithm for the set covering problem, Working Paper, The Management School, Imperial College, London SW7 2AZ, England, 1994."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581106.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581106\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:54:42Z","timestamp":1586231682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["BF01581106"],"URL":"https:\/\/doi.org\/10.1007\/bf01581106","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}