{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:48Z","timestamp":1747579548831},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669920"},{"type":"electronic","value":"9783540465843"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46584-7_20","type":"book-chapter","created":{"date-parts":[[2007,9,17]],"date-time":"2007-09-17T18:28:04Z","timestamp":1190053684000},"page":"293-307","source":"Crossref","is-referenced-by-count":14,"title":["A Hybrid Approach for Solving Large Scale Crew Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Tallys H.","family":"Yunes","sequence":"first","affiliation":[]},{"given":"Arnaldo V.","family":"Moura","sequence":"additional","affiliation":[]},{"given":"Cid C.","family":"de Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,1,28]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J. E. Beasley","year":"1989","unstructured":"J. E. Beasley and N. Christofides. An algorithm for the resource constrained shortest path problem. Networks, 19:379\u2013394, 1989.","journal-title":"Networks"},{"unstructured":"A. Caprara, M. Fischetti, and P. Toth. A heuristic method for the set covering problem. Technical Report OR-95-8, DEIS, Universit\u00e0 di Bologna, 1995.","key":"20_CR2"},{"unstructured":"B. M. W. Cheng, K. M. F. Choi, J. H. M. Lee, and J. C. K. Wu. Increasing constraint propagation by redundant modeling: an experience report. Constraints, 1998. Accepted for publication.","key":"20_CR3"},{"doi-asserted-by":"crossref","unstructured":"K. Darby-Dowman and J. Little. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS Journal on Computing, 10(3), 1998.","key":"20_CR4","DOI":"10.1287\/ijoc.10.3.276"},{"doi-asserted-by":"crossref","unstructured":"M. Desrochers and F. Soumis. A column generation approach to the urban transit crew scheduling problem. Transportation Science, 23(1), 1989.","key":"20_CR5","DOI":"10.1287\/trsc.23.1.1"},{"unstructured":"C. Gervet. Large Combinatorial Optimization Problems: a Methodology for Hybrid Models and Solutions. In JFPLC, 1998.","key":"20_CR6"},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M. L. Ginsberg","year":"1993","unstructured":"M. L. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, (1):25\u201346, 1993.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"20_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/3-540-60299-2_29","volume-title":"Solving crew scheduling problems by constraint programming","author":"N. Guerinik","year":"1995","unstructured":"N. Guerinik and M. Van Caneghem. Solving crew scheduling problems by constraint programming. In Lecture Notes in Computer Science, pages 481\u2013498, 1995. Proceedings of the First International Conference on the Principles and Practice of Constraint Programming, CP\u201995."},{"unstructured":"J. Jourdan. Concurrent Constraint Multiple Models in CLP and CC Languages: Toward a Programming Methodology by Modeling. PhD thesis, Universit\u00e9 Denis Diderot, Paris VII, February 1995.","key":"20_CR9"},{"key":"20_CR10","first-page":"73","volume":"13","author":"J. Lever","year":"1995","unstructured":"J. Lever, M. Wallace, and B. Richards. Constraint logic programming for scheduling and planning. BT Technical Journal, (13):73\u201381, 1995.","journal-title":"BT Technical Journal"},{"unstructured":"C. R. Reeves, editor. Modern Heuristic Techniques for Combinatorial Problems. Wiley, 1993.","key":"20_CR11"},{"unstructured":"D. M. Ryan and B. A. Foster. An integer programming approach to scheduling. In A. Wren, editor, Computer Scheduling of Public Transport. North-Holland Publishing Company, 1981.","key":"20_CR12"},{"unstructured":"F. Vanderbeck. Decomposition and Column Generation for Integer Programming. PhD thesis, Universit\u00e9 Catholique de Louvain, CORE, September 1994.","key":"20_CR13"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46584-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T15:50:42Z","timestamp":1550937042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46584-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669920","9783540465843"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46584-7_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}