{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:46Z","timestamp":1747579546990},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540658214"},{"type":"electronic","value":"9783540489337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/bfb0100560","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T18:11:30Z","timestamp":1165515090000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["High performance integer optimization for crew scheduling"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuomo","family":"Takkula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dag","family":"Wedelin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,17]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"P. Alefragis, C. Goumopoulos, E. Housos, P. Sanders, T. Takkula, and D. Wedelin. Parallel crew scheduling in PAROS. In EUROPAR'98, Lecture Notes in Computer Science, 1998. to appear.","key":"1_CR1","DOI":"10.1007\/BFb0057972"},{"key":"1_CR2","volume-title":"OR in the Airline Industry","author":"E. Andersson","year":"1997","unstructured":"E. Andersson, E. Housos, N. Kohl, and D. Wedelin. OR in the Airline Industry, chapter Crew Pairing Optimization, Kluwer Academic Publishers, Boston, London, Dordrecht, 1997."},{"unstructured":"C. Barnhart and R. G. Shenoi. An alternate model and solution approach for the long-haul crew pairing problem. Jul 1996.","key":"1_CR3"},{"doi-asserted-by":"crossref","unstructured":"A. Caprara, M. Fischetti, and P. Toth. A heuristic algorithm for the set covering problem. In Lecture Notes in Computer Science, pages 72\u201384, 1996.","key":"1_CR4","DOI":"10.1007\/3-540-61310-2_6"},{"unstructured":"The Carmen System, version 5.1. Carmen Systems AB, G\u00f6teborg, Sweden.","key":"1_CR5"},{"key":"1_CR6","volume-title":"A Lagrangian-based heuristic for large-scale set covering problems","author":"S. Ceria","year":"1995","unstructured":"S. Ceria, P. Nobili, and A. Sassano. A Lagrangian-based heuristic for large-scale set covering problems. Technical report, Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma, La Sapienza, Italy, 1995."},{"unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.","key":"1_CR7"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0377-2217(96)00195-6","volume":"97","author":"G. Desaulniers","year":"1997","unstructured":"G. Desaulniers, J. Desrosiers, Y. Dumas, S. Marc, B. Rioux, M. Solomon, and F. Soumis. Crew pairing at Air France. European Journal of Operational Research, 97:245\u2013259, 1997.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1_CR9","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 Sciences, 27(1):1\u201318, 1981.","journal-title":"Management Sciences"},{"doi-asserted-by":"crossref","unstructured":"C. Goumopoulos, P. Alefragis, and E. Housos. Parallel algorithms for airline crew planning on networks of workstations. In International Conference on Parallel Processing, Minneapolis, 1998.","key":"1_CR10","DOI":"10.1109\/ICPP.1998.708465"},{"doi-asserted-by":"crossref","unstructured":"C. Goumopoulos, E. Housos, and O. Liljenzin. Parallel crew scheduling on work-station networks using PVM. In Euro PVM-MPI, number 1332 in LNCS, Cracow, Poland, 1997.","key":"1_CR11","DOI":"10.1007\/3-540-63697-8_119"},{"issue":"6","key":"1_CR12","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K. L. Hoffman","year":"1993","unstructured":"K. L. Hoffman and M. Padberg. Solving airline crew scheduling problems by branch-and-cut. Management Science, 39(6):657\u2013682, 1993.","journal-title":"Management Science"},{"key":"1_CR13","doi-asserted-by":"publisher","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 by column generation with an application to air transportation. European Journal of Operations Research, 35:45\u201358, 1988.","journal-title":"European Journal of Operations Research"},{"unstructured":"R. Marsten. RALPH: Crew Planning at Delta Air Lines. Technical Report. Cutting Edge Optimization, 1997.","key":"1_CR14"},{"doi-asserted-by":"crossref","unstructured":"J. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.","key":"1_CR15","DOI":"10.1017\/CBO9780511814075"},{"unstructured":"M. Snir, S. W. Otto, S. Huss-Lederman, D. W. Walker, and J. Dongarra. MPI\u2014the Complete Reference. MIT Press, 1996.","key":"1_CR16"},{"unstructured":"P. H. Vance. Crew Scheduling, Cutting Stock, and Column Generation: Solving Huge Integer Programs. PhD thesis, Georgia Institute of Technology, August 1993.","key":"1_CR17"},{"key":"1_CR18","doi-asserted-by":"publisher","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 Operations Research, 57:283\u2013301, 1995.","journal-title":"Annals of Operations Research"},{"unstructured":"A. Wool and T. Grossman. Computational experience with approxima-tion algorithms for the set covering problem. Technical Report CS94-25, Weizmann Institute of Science, Faculty of Mathematical Sciences, Jan. 1, 1994.","key":"1_CR19"}],"container-title":["Lecture Notes in Computer Science","High-Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0100560","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T19:37:41Z","timestamp":1555961861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0100560"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658214","9783540489337"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0100560","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}