{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T14:07:15Z","timestamp":1775570835927,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":[[1997,10]]},"DOI":"10.1007\/bf02614314","type":"journal-article","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T04:34:10Z","timestamp":1177734850000},"page":"125-141","source":"Crossref","is-referenced-by-count":97,"title":["Algorithms for railway crew management"],"prefix":"10.1007","volume":"79","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"}]},{"given":"Daniele","family":"Vigo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pier Luigi","family":"Guida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02614314_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230200103","volume":"20","author":"N. Balakrishnan","year":"1990","unstructured":"N. Balakrishnan and R.T. Wong, A network model for the rotating workforce scheduling problem,Networks 20 (1990) 25\u201342.","journal-title":"Networks"},{"key":"BF02614314_CR2","doi-asserted-by":"crossref","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 (1996) 875\u2013890.","journal-title":"Operations Research"},{"key":"BF02614314_CR3","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,Mathematical Programming Study 12 (1980) 37\u201360.","journal-title":"Mathematical Programming Study"},{"key":"BF02614314_CR4","unstructured":"C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh and P.H. Vance, Branch-and-price: Column generation for solving huge integer programs, in: J.R. Birge and K.G. Murty, eds.,Mathematical Programming: State of the Art 1994 (The University of Michigan, 1994) 186\u2013207."},{"key":"BF02614314_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"J.E. Beasley","year":"1987","unstructured":"J.E. Beasley, An algorithm for set covering problems,European Journal of Operational Research 31 (1987) 85\u201393.","journal-title":"European Journal of Operational Research"},{"key":"BF02614314_CR6","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 Lagrangian heuristic for set covering problems,Naval Research Logistics 37 (1990) 151\u2013164.","journal-title":"Naval Research Logistics"},{"key":"BF02614314_CR7","doi-asserted-by":"crossref","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 (1996) 392\u2013404.","journal-title":"European Journal of Operational Research"},{"key":"BF02614314_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"J.E. Beasley","year":"1992","unstructured":"J.E. Beasley and K. J\u00f6rnsten, Enhancing an algorithm for set covering problems,European Journal of Operational Research 58 (1992) 293\u2013300.","journal-title":"European Journal of Operational Research"},{"key":"BF02614314_CR9","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/0377-2217(92)90213-S","volume":"58","author":"L. Bianco","year":"1992","unstructured":"L. Bianco, M. Bielli, A. Mingozzi, S. Ricciardelli and M. Spadoni, A heuristic procedure for the crew rostering problem,European Journal of Operational Research 58 (1992) 272\u2013283.","journal-title":"European Journal of Operational Research"},{"key":"BF02614314_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L. Bodin","year":"1983","unstructured":"L. Bodin, B. Golden, A. Assad and M. Ball, Routing and scheduling of vehicles and crews: The state of the art,Computer and Operations Research 10 (1983) 63\u2013211.","journal-title":"Computer and Operations Research"},{"key":"BF02614314_CR11","unstructured":"A. Caprara, M. Fischetti and P. Toth, A heuristic method for the set covering problem, Technical Report OR-95-8, DEIS University of Bologna, 1995, extended abstract published in: W.H. Cunningham, S.T. McCormick and M. Queyranne, eds.,Proceedings of the 5th IPCO Conference, Lecture Notes in Computer Science, Vol. 1084 (Springer, Berlin, 1995) 72\u201384."},{"key":"BF02614314_CR12","unstructured":"A. Caprara, M. Fischetti, P. Toth and D. Vigo, Modeling and solving the crew rostering problem, Technical Report OR-95-6, DEIS University of Bologna, 1995; Also in:Operations Research, to appear."},{"key":"BF02614314_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0377-2217(84)90068-7","volume":"16","author":"P. Carraresi","year":"1984","unstructured":"P. Carraresi and G. Gallo, Network models for vehicle and crew scheduling,European Journal of Operational Research 16 (1984) 139\u2013151.","journal-title":"European Journal of Operational Research"},{"key":"BF02614314_CR14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0377-2217(84)90071-7","volume":"16","author":"P. Carraresi","year":"1984","unstructured":"P. Carraresi and G. Gallo, A multilevel bottleneck assignment approach to the bus drivers\u2019 rostering problem,European Journal of Operational Research 16 (1984) 163\u2013173.","journal-title":"European Journal of Operational Research"},{"key":"BF02614314_CR15","unstructured":"S. Ceria, P. Nobili and A. Sassano, A Lagrangian-based heuristic for large-scale set covering problems, Technical Report R. 406, IASI-CNR, Rome, 1995; also in:Mathematical Programming, to appear."},{"key":"BF02614314_CR16","series-title":"Lecture Notes in Economic and Mathematical Systems","volume-title":"Computer-Aided Transit Scheduling","year":"1988","unstructured":"J.R. Daduna and A. Wren, eds.,Computer-Aided Transit Scheduling, Lecture Notes in Economic and Mathematical Systems, Vol. 308 (Springer, Berlin, 1988)."},{"key":"BF02614314_CR17","series-title":"Lecture Notes in Economic and Mathematical Systems","volume-title":"Computer-Aided Transit Scheduling","year":"1992","unstructured":"M. Desrochers and J.-M. Rousseau, eds.,Computer-Aided Transit Scheduling, Lecture Notes in Economic and Mathematical Systems, Vol. 386 (Springer, Berlin, 1992)."},{"key":"BF02614314_CR18","first-page":"35","volume-title":"Handbooks in OR & MS","author":"J. Desrosiers","year":"1995","unstructured":"J. Desrosiers, Y. Dumas, M.M. Solomon and F. Soumis, Time constrained routing and scheduling, in: M.O. Ball et al., eds.,Handbooks in OR & MS, Vol. 8 (Elsevier, Amsterdam, 1995) 35\u2013139."},{"key":"BF02614314_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems,Management Science 27 (1981) 1\u201318.","journal-title":"Management Science"},{"key":"BF02614314_CR20","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, Optimal solutions of set covering\/partitioning problems using dual heuristics,Management Science 36 (1990) 674\u2013688.","journal-title":"Management Science"},{"key":"BF02614314_CR21","unstructured":"M. Gamache and F. Soumis, A method for optimally solving the rostering problem, Les Cahiers du GERAD G-93-40, Montr\u00e9al, 1993."},{"key":"BF02614314_CR22","unstructured":"M. Gamache, F. Soumis, G. Marquis and J. Desrosiers, A column generation approach for large scale aircrew rostering problems, Cahiers du GERAD G-94-20, Montr\u00e8al, 1994."},{"key":"BF02614314_CR23","volume-title":"Computer Scheduling of Public Transport","author":"B. Hagberg","year":"1985","unstructured":"B. Hagberg, An assignment approach to the rostering problem, in: J.-M. Rousseau, ed.,Computer Scheduling of Public Transport, Vol. 2 (North-Holland, Amsterdam, 1985)."},{"key":"BF02614314_CR24","volume-title":"Computer Scheduling of Public Transport","author":"J.K. Jachnik","year":"1981","unstructured":"J.K. Jachnik, Attendance and rostering systems, in: A. Wren, ed.,Computer Scheduling of Public Transport (North-Holland, Amsterdam, 1981)."},{"key":"BF02614314_CR25","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M","volume":"52","author":"L.W. Jacobs","year":"1995","unstructured":"L.W. Jacobs and M.J. Brusco, A local search heuristic for large set-covering problems,Naval Research Logistic 52 (1995) 1129\u20131140.","journal-title":"Naval Research Logistic"},{"key":"BF02614314_CR26","unstructured":"A.I.Z. Jarrah and J.T. Diamond, The crew bidline generation problem, Technical Report, SABRE Decision Technologies, 1995."},{"key":"BF02614314_CR27","doi-asserted-by":"crossref","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, A surrogate heuristic for set covering problems,European Journal of Operational Research 79 (1994) 138\u2013150.","journal-title":"European Journal of Operational Research"},{"key":"BF02614314_CR28","volume-title":"Computer Scheduling of Public Transport","year":"1985","unstructured":"J.-M. Rousseau, ed.,Computer Scheduling of Public Transport, Vol. 2 (North-Holland, Amsterdam, 1985)."},{"key":"BF02614314_CR29","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1057\/jors.1992.72","volume":"43","author":"D.M. Ryan","year":"1992","unstructured":"D.M. Ryan, The solution of massive generalized set partitioning problems in aircrew rostering,Journal of the Operational Research Society 43 (1992) 459\u2013467.","journal-title":"Journal of the Operational Research Society"},{"key":"BF02614314_CR30","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/1024063","volume":"24","author":"J.M. Tien","year":"1982","unstructured":"J.M. Tien and A. Kamiyama, On manpower scheduling algorithms,SIAM Review 24 (1982) 275\u2013287.","journal-title":"SIAM Review"},{"key":"BF02614314_CR31","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02099703","volume":"57","author":"D. Wedelin","year":"1995","unstructured":"D. Wedelin, An algorithm for large scale 0\u20131 integer programming with application to airline crew scheduling,Annals of Operational Research 57 (1995) 283\u2013301.","journal-title":"Annals of Operational Research"},{"key":"BF02614314_CR32","unstructured":"T.H. Wise, Column generation and polyhedral combinatorics for airline crew scheduling, Ph.D. Thesis, Cornell University, 1995."},{"key":"BF02614314_CR33","volume-title":"Computer Scheduling of Public Transport","year":"1981","unstructured":"A. Wren, ed.,Computer Scheduling of Public Transport (North-Holland, Amsterdam, 1981)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614314.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02614314\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:49:23Z","timestamp":1558342163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02614314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["BF02614314"],"URL":"https:\/\/doi.org\/10.1007\/bf02614314","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}