{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T14:58:20Z","timestamp":1770217100318,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf02099703","type":"journal-article","created":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T20:03:31Z","timestamp":1126555411000},"page":"283-301","source":"Crossref","is-referenced-by-count":119,"title":["An algorithm for large scale 0\u20131 integer programming with application to airline crew scheduling"],"prefix":"10.1007","volume":"57","author":[{"given":"Dag","family":"Wedelin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02099703_CR1","doi-asserted-by":"crossref","unstructured":"E.H.L. Aarts and J.H.M. Korst,Simulated Annealing and Boltzmann Machines (Wiley, 1989).","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"key":"BF02099703_CR2","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1287\/trsc.3.2.140","volume":"3","author":"J.P. Arabeyre","year":"1969","unstructured":"J.P. Arabeyre, J. Fearnley, F.C. Steiger and W. Teather, The Airline Crew scheduling problem: A survey, Transp. Sci. 3(1969)140\u2013163.","journal-title":"Transp. Sci."},{"key":"BF02099703_CR3","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01588309","volume":"18","author":"D. Avis","year":"1980","unstructured":"D. Avis, A note on some computationally difficult set covering problems, Math. Progr. 18(1980)138\u2013145.","journal-title":"Math. Progr."},{"key":"BF02099703_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","volume":"12","author":"E. Balas","year":"1980","unstructured":"E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study, Math. Progr. Study 12(1980)37\u201360.","journal-title":"Math. Progr. Study"},{"key":"BF02099703_CR5","doi-asserted-by":"crossref","unstructured":"U. Bertele and F. Brioschi,Nonserial Dynamic Programming (Academic Press, 1972).","DOI":"10.1051\/ro\/197105V200871"},{"key":"BF02099703_CR6","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, Math. Oper. Res. 4(1979)233\u2013235.","journal-title":"Math. Oper. Res."},{"key":"BF02099703_CR7","unstructured":"CPLEX Reference Manual (CPLEX Optimization Inc., 1992)."},{"key":"BF02099703_CR8","unstructured":"J. Derosiers, Y. Dumas, M.M. Solomon and F. Soumis, Time constrained routing and scheduling, in:Handbooks in Operations Research and Management Science, volume onNetworks (North-Holland, 1993), to be published."},{"key":"BF02099703_CR9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/trsc.19.2.127","volume":"19","author":"M.M. Etschmaier","year":"1985","unstructured":"M.M. Etschmaier and D.F. Mathaisel, Airline scheduling: an overview, Transp. Sci. 19(1985)127\u2013138.","journal-title":"Transp. Sci."},{"key":"BF02099703_CR10","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 and M.G.C. Resende, A probabilistic heuristic for a computational difficult set covering problem, Oper. Res. Lett. 8(1989)67\u201371.","journal-title":"Oper. Res. Lett."},{"key":"BF02099703_CR11","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","volume":"7","author":"D.R. Fulkerson","year":"1974","unstructured":"D.R. Fulkerson, G.L. Nemhauser and L.E. Trotter, Jr., Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems, Math. Progr. Study 7(1974)72\u201381.","journal-title":"Math. Progr. Study"},{"key":"BF02099703_CR12","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, 1979)."},{"key":"BF02099703_CR13","unstructured":"T.C. Hu,Integer Programming and Network Flows (Addison-Wesley, 1969)."},{"key":"BF02099703_CR14","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF01582907","volume":"52","author":"N. Karmarkar","year":"1991","unstructured":"N. Karmarkar, M.G.C. Resende and K.G. Ramakrishnan, An interior point algorithm to solve computationally difficult set covering problems, Math. Progr. 52(1991)597\u2013618.","journal-title":"Math. Progr."},{"key":"BF02099703_CR15","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 and E. Odier, A new approach for crew pairing problems with an application to air transportation, Euro. J. Oper. Res. 35(1988)45\u201358.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02099703_CR16","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinational Optimization (Wiley, 1988).","DOI":"10.1002\/9781118627372"},{"key":"BF02099703_CR17","unstructured":"A. Schrijver,Theory of Linear and Integer Programming (Wiley, 1986)."},{"key":"BF02099703_CR18","unstructured":"M. Syslo, N. Deo and J.S. Kowalik,Discrete Optimization Algorithms (Prentice-Hall, 1983)."},{"key":"BF02099703_CR19","unstructured":"D. Wedelin, Probabilistic networks and combinatorial optimization, Technical report 49, Department of Computing Science, Chalmers University of Technology (1989)."},{"key":"BF02099703_CR20","unstructured":"D. Wedelin, Probabilistic inference, combinatorial optimization and the discovery of causal structure from data, Ph.D Thesis, Department of Computing Science, Chalmers University of Technology (1993)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02099703.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02099703\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02099703","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T12:15:53Z","timestamp":1683202553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02099703"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF02099703"],"URL":"https:\/\/doi.org\/10.1007\/bf02099703","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}