{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:52:08Z","timestamp":1775029928134,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1023\/a:1011223523191","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T04:18:21Z","timestamp":1040617101000},"page":"73-91","source":"Crossref","is-referenced-by-count":64,"title":["Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching"],"prefix":"10.1007","volume":"20","author":[{"given":"Diego","family":"Klabjan","sequence":"first","affiliation":[]},{"given":"Ellis L.","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Gelman","sequence":"additional","affiliation":[]},{"given":"Srini","family":"Ramaswamy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"353476_CR1","doi-asserted-by":"crossref","unstructured":"R. Anbil, J. Forrest, and W. Pulleyblank, 1998. Column Generation, and the Airline Crew Pairing Problem, Extra Volume Proceedings ICM. Available from http:\/\/www.math.uiuc.edu\/documenta\/xvol-icm\/17\/17.html.","DOI":"10.4171\/dms\/1-3\/65"},{"key":"353476_CR2","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, and R. Tanga, \u201cRecent advances in crew pairing optimization at American airlines,\u201d Interfaces vol. 21, pp. 62\u201374, 1991.","journal-title":"Interfaces"},{"key":"353476_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1147\/sj.311.0071","volume":"31","author":"R. Anbil","year":"1992","unstructured":"R. Anbil, E. Johnson, and R. Tanga, \u201cA global approach to crew pairing optimization,\u201d IBM Systems Journal, vol. 31, pp. 71\u201378, 1992.","journal-title":"IBM Systems Journal"},{"key":"353476_CR4","doi-asserted-by":"crossref","unstructured":"E. Andersson, E. Housos, N. Kohl, and D. Wedelin, \u201cCrew pairing optimization,\u201d in Operations Research in the Airline Industry, G. Yu (Ed.), Kluwer Academic Publishers, 1998, pp. 228\u2013258.","DOI":"10.1007\/978-1-4615-5501-8_8"},{"key":"353476_CR5","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance, \u201cBranch-and-price: Column generation for solving huge integer programs,\u201d Operations Research, vol. 46, pp. 316\u2013329, 1998.","journal-title":"Operations Research"},{"key":"353476_CR6","doi-asserted-by":"crossref","unstructured":"C. Barnhart, E. Johnson, G. Nemhauser, and P. Vance, \u201cCrew scheduling,\u201d in Handbook of Transportation Science, R.W. Hall (Ed.), Kluwer Scientific Publishers, 1999, pp. 493\u2013521.","DOI":"10.1007\/978-1-4615-5203-1_14"},{"key":"353476_CR7","unstructured":"E. Beale, and J. Tomlin, \u201cSpecial facilities in a general mathematical programming system for non-convex problems using ordered sets of variables,\u201d in Proceedings of the 5th International Conference on Operations Research, 1970."},{"key":"353476_CR8","unstructured":"D. Bertsekas, Nonlinear Programming, Athena Scientific, 1995, pp. 79\u201390."},{"key":"353476_CR9","unstructured":"R. Bixby, W. Cook, A. Cox, and E. Lee, \u201cParallel mixed integer programming,\u201d Technical Report CRPCTR95554, Rice University. Available from ftp:\/\/softlib.rice.edu\/pub\/CRPC-TRs\/reports."},{"key":"353476_CR10","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1287\/opre.40.5.885","volume":"40","author":"R. Bixby","year":"1992","unstructured":"R. Bixby, J. Gregory, I. Lustig, R. Marsten, and D. Shanno, \u201cVery large-scale linear programming: A case study in combining interior point, and simplex methods,\u201d Operations Research, vol. 40, pp. 885\u2013897, 1992.","journal-title":"Operations Research"},{"key":"353476_CR11","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(96)00196-8","volume":"97","author":"H. Chu","year":"1997","unstructured":"H. Chu, E. Gelman, and E. Johnson, \u201cSolving large scale crew scheduling problems,\u201d European Journal of Operational Research, vol. 97, pp. 260\u2013268, 1997.","journal-title":"European Journal of Operational Research"},{"key":"353476_CR12","unstructured":"CPLEX Optimization 1997. Using the CPLEX Callable Library, 5.0 edn, ILOG Inc."},{"key":"353476_CR13","unstructured":"J. Desrosiers, Y. Dumas, M. Desrochers, F. Soumis, B. Sanso, and P. Trudeau, \u201cA breakthrough in airline crew scheduling,\u201d Technical Report G-91-11, Cahiers du GERAD."},{"key":"353476_CR14","unstructured":"M. Dyer, A. Frieze, A. Kapoor, R. Kannan, L. Perkovic, and U. Vazirani, \u201cA mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem.\u201d Unpublished."},{"key":"353476_CR15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T. Feo","year":"1989","unstructured":"T. Feo and M. Resende, \u201cA probabilistic heuristic for a computationally difficult set covering problem,\u201d Operations Research Letters, vol. 8, pp. 67\u201371, 1989.","journal-title":"Operations Research Letters"},{"key":"353476_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/inte.19.4.29","volume":"19","author":"I. Gershkoff","year":"1989","unstructured":"I. Gershkoff, \u201cOptimizing flight crew schedules,\u201d Interfaces, vol. 19, pp. 29\u201343, 1989.","journal-title":"Interfaces"},{"key":"353476_CR17","unstructured":"D. Klabjan, \u201cTopics in airline crew scheduling and large scale optimization,\u201d Ph.D. Dissertation, Georgia Institute of Technology, 1999."},{"key":"353476_CR18","unstructured":"D. Klabjan, E. Johnson, and G. Nemhauser, \u201cA parallel primal-dual algorithm,\u201d Technical Report TLI\/LEC-99-10, Georgia Institute of Technology, 1990. To appear in Operations Research Letters."},{"key":"353476_CR19","unstructured":"D. Klabjan and K. Schwan, \u201cAirline crew pairing generation in parallel,\u201d Technical Report TLI\/LEC-99-02, Georgia Institute of Technology, 1999."},{"key":"353476_CR20","unstructured":"A. Law and W. Kelton. Simulation, Modeling, and Analysis, McGraw-Hill, 1991."},{"key":"353476_CR21","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"J. Linderoth","year":"1999","unstructured":"J. Linderoth and M. Savelsbergh, \u201cAcomputational study of search strategies for mixed integer programming,\u201d Informs Journal on Computing, vol. 11, pp. 173\u2013187, 1999.","journal-title":"Informs Journal on Computing"},{"key":"353476_CR22","unstructured":"Message Passing Interface Forum, The MPI Message Passing Standard, 1995. Available from http:\/\/www.mpiforum.org."},{"key":"353476_CR23","unstructured":"D. Ryan and B. Foster, \u201cAn integer programming approach to scheduling,\u201d in Computer Scheduling of Public Transport Urban Passenger Vehicle, and Crew Scheduling, A. Wren (Ed.), North-Holland, 1981, pp. 269\u2013280."},{"key":"353476_CR24","unstructured":"P. Vance, A. Atamt\u00fcrk, C. Barnhart, E. Gelman, E. Johnson, A. Krishna, D. Mahidhara, G. Nemhauser, and R. Rebello, \u201cA heuristic branch-and-price approach for the airline crew pairing problem,\u201d Technical Report LEC-97-06, Georgia Institute of Technology, 1997."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011223523191.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011223523191\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011223523191.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:24:00Z","timestamp":1752377040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011223523191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["353476"],"URL":"https:\/\/doi.org\/10.1023\/a:1011223523191","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}