{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:07:08Z","timestamp":1771024028713,"version":"3.50.1"},"reference-count":88,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"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":[[2005,11]]},"DOI":"10.1007\/s10479-005-3975-3","type":"journal-article","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T12:12:53Z","timestamp":1133007173000},"page":"305-337","source":"Crossref","is-referenced-by-count":133,"title":["Airline Crew Scheduling: State-of-the-Art"],"prefix":"10.1007","volume":"140","author":[{"given":"Balaji","family":"Gopalakrishnan","sequence":"first","affiliation":[]},{"given":"Ellis. L.","family":"Johnson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3975_CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/inte.21.1.62","volume":"21","author":"R. Anbil","year":"1991","unstructured":"Anbil, R., E. Gelman, B. Patty, and R. Tanga. (1991). \u201cRecent Advances in Crew-Pairing Optimization at American Airlines.\u201d Interfaces 21, 62\u201374.","journal-title":"Interfaces"},{"key":"3975_CR2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1147\/sj.311.0071","volume":"31","author":"R. Anbil","year":"1991","unstructured":"Anbil, R., E.L. Johnson, and R. Tanga. (1991). \u201cA Gobal Approach to Crew Pairing Optimization.\u201d IBM Systems Journal 31, 71\u201378","journal-title":"IBM Systems Journal"},{"key":"3975_CR3","unstructured":"Anbil, R., J. Forrest, and W. Pulleyblank. (1998). \u201cColumn Generation and the Airline Crew Pairing Problem.\u201d Documenta Mathematica\u2014Journal der Deutschen MathematikerVereinigung, number III in extra volume: proceedings of the ICM."},{"key":"3975_CR4","volume-title":"OR in airline industry","author":"E. Anderson","year":"1997","unstructured":"Anderson, E., E. Housos, N. Kohl, and D. Wedelin. (1997). \u201cCrew Pairing Optimization.\u201d In G. Yu, (ed.), OR in airline industry, Kluwer Acad. Publ., Boston."},{"key":"3975_CR5","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1287\/trsc.3.2.140","volume":"3","author":"J. P. Arabeyre","year":"1969","unstructured":"Arabeyre, J. P., J. Feanley, F.C. Stieger, and W. Teather. (1969). \u201cThe Airline Crew Scheduling Problem: A Survey.\u201d Transportation Science 3, 140\u2013163.","journal-title":"Transportation Science"},{"issue":"2","key":"3975_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10107-003-0390-x","volume":"96","author":"J. Araoz","year":"2003","unstructured":"Araoz, J., L. Evans, R.E. Gomory, and E.L. Johnson. (2003). \u201cCyclic Group and Knapsack Facets.\u201d Mathematical Programming 96(2), 337\u2013408.","journal-title":"Mathematical Programming"},{"key":"3975_CR7","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"Balas, E. and M. Padberg. (1976). \u201cSet Partitioning: A Survey.\u201d SIAM Review 18, 710\u2013760.","journal-title":"SIAM Review"},{"key":"3975_CR8","unstructured":"Balas, E. and S.M. Ng. (1986). \u201cOn the Set-Covering Polytope I: All Facets with Coefficients {0,1,2}.\u201d MSSR-522, GSIA, Carnegie-Mellon U."},{"key":"3975_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996","unstructured":"Balas, E., S. Ceria, G. Cornuejols, and N. Natraj. (1996). \u201cGomory Cuts Revisited.\u201d Operations Research Letters 19, 1\u20139.","journal-title":"Operations Research Letters"},{"key":"3975_CR10","unstructured":"Barahona, F. and R. Anbil. (1997). \u201cThe Volume Algorithm: Producing Primal Solutions with a Subgradient Method.\u201d Research Report RC 21103 (94395), IBM T.J. Watson Research Center, Yorktown Heights, NY."},{"key":"3975_CR11","first-page":"95","volume":"3","author":"E.K. Baker","year":"1985","unstructured":"Baker, E.K., L.D. Bodin, and M. Fisher. (1985). \u201cThe Development of a Heuristic Set Covering Based System for Aircrew Scheduling.\u201d Transportation Policy Decision Making 3, 95\u2013110.","journal-title":"Transportation Policy Decision Making"},{"issue":"2","key":"3975_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/trsc.19.2.107","volume":"19","author":"M. Ball","year":"1985","unstructured":"Ball, M. and A. Roberts. (1985). \u201cA Graph Partitioning Approach to Airline Crew Scheduling.\u201d Transportation Science 19(2) 107\u2013126.","journal-title":"Transportation Science"},{"key":"3975_CR13","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1287\/opre.43.3.491","volume":"43","author":"C. Barnhart","year":"1995","unstructured":"Barnhart, C., L. Hatay, and E.L. Johnson. (1995). \u201cDeadhead Selection for the Long-Haul Crew Pairing Problem.\u201d Operations Research 43, 491\u2013499.","journal-title":"Operations Research"},{"key":"3975_CR14","unstructured":"Barnhart, C., E.L. Hohnson, R. Anbil, and L. Hatay. (1994). \u201cA Column Generation Technique for the Long-Haul Crew Assignment Problem.\u201d In T.A. Cirani and R.C. Leachman (eds.), Optimization in Industry II, Wiley."},{"key":"3975_CR15","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1287\/opre.43.3.491","volume":"43","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance. (1998). \u201cBranch-and-Price: Column Generation for Solving Huge Integer Programs.\u201d Operations Research, 43, 491\u2013499.","journal-title":"Operations Research"},{"key":"3975_CR16","unstructured":"Barutt, J. and T. Hull. (1990). \u201cAirline Crew Scheduling: Supercomputers and Algorithms.\u201d SIAM News 23(6), 1 and 20\u201322."},{"key":"3975_CR17","unstructured":"Beale, E. and J. Tomlin. (1970). \u201cSpecial Facilities in a General Mathematical Programming System for Non-Convex Problems Using Ordered Sets of Variables.\u201d Proceedings of the 5th International Conference on Operations Research."},{"key":"3975_CR18","unstructured":"Bixby, R., W. Cook, A. Cox, and E. Lee. (1995). \u201cParallel Mixed Integer Programming.\u201d Technical Report CRPC-TR95554, Rice University. Available from ftp:\/\/softlib.rice.edu\/pub\/CRPC-TRs\/reports"},{"key":"3975_CR19","unstructured":"Bornemann, D.R. (1982). \u201cThe Evolution of Airline Crew Pairing Optimization.\u201d AGIFORS Crew Management Study Group Proceedings, Rio de Janeiro (April)."},{"key":"3975_CR20","unstructured":"The Carmen Systems, version 5.1, Carmen Systems AB, G\u00f6teborg, Sweden."},{"key":"3975_CR21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0377-2217(96)00195-6","volume":"97","author":"H. Chu","year":"1997","unstructured":"Chu, H., E. Gelman, and E.L. Johnson. (1997). \u201cSolving Large Scale Crew Scheduling Problem.\u201d European Journal of Operations Research 97, 245\u2013259.","journal-title":"European Journal of Operations Research"},{"key":"3975_CR22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01582277","volume":"43","author":"G. Cornuejols","year":"1989","unstructured":"Cornuejols, G. and A. Sassano. (1989). \u201cOn the 0,1 Facets of the Set Covering Polytope.\u201d Mathematical Programming 43, 101\u2013111.","journal-title":"Mathematical Programming"},{"key":"3975_CR23","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder, H., E.L. Johnson, and M.W. Padberg. (1983). \u201cSolving Large-Scale 0-1 Linear Programming Problems.\u201d Operations Research 31, 803\u2013834.","journal-title":"Operations Research"},{"key":"3975_CR24","unstructured":"CPLEX Optimization, \u201cUsing the CPLEX Callable Library.\u201d 7.0 edn, ILOG Inc."},{"key":"3975_CR25","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig, G.B. and P. Wolfe. (1960). \u201cDecomposition Principle for Linear Programs.\u201d Operations Research 8, 101\u2013111.","journal-title":"Operations Research"},{"key":"3975_CR26","unstructured":"Desrosiers, J., Y. Dumas, M. Desrochers, F. Soumis, B. Sasno, and P. Trudeau. (1991). \u201cA Breakthrough in Airline Crew Scheduling.\u201d Technical Report G-91-11, Les Cahiers du GERAD."},{"key":"3975_CR27","unstructured":"Desrochers, J., Y. Dumas, M.M. Solomon, and F. Soumis (1995). \u201cTime Constrained Routing and Scheduling.\u201d In M.E. Ball, T.L. Magnanti, C. Monma and G.L. Nemhauser (eds.), Handbook in Operations Research and Management Science, 8: Network Routing, Elsevier, Amsterdam, 35\u2013140."},{"key":"3975_CR28","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., J. Desrosiers, Y. Dumas, S. Marc, B. Rioux, M.M. Solomon, and F. Soumis. (1997). \u201cCrew Pairing at Air France\u201d 97, 245\u2013259.","DOI":"10.1016\/S0377-2217(96)00195-6"},{"key":"3975_CR29","unstructured":"Ehrgott, M. and D.M. Ryan. (2003). \u201cConstructing Robust Crew Schedules with Bicriteria Optimization.\u201d Journal of Multi-Criteria Decision Analysis 11, 139\u2013150, 2002."},{"key":"3975_CR30","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/trsc.19.2.127","volume":"19","author":"M.M. Etschmaier","year":"1985","unstructured":"Etschmaier, M.M. and D.F.X. Mathaisel. (1985). \u201cAirline Scheduling: An Overview.\u201d Transportation Science 19, 127\u2013138.","journal-title":"Transportation Science"},{"issue":"1","key":"3975_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L. (1981). \u201cThe Lagrangian Relaxation Method for Solving Integer Programming Problems.\u201d Management Science 27(1), 1\u201318.","journal-title":"Management Science"},{"key":"3975_CR32","unstructured":"Forrest, J.J. (1989). \u201cMathematical Programming with a Library of Optimization Subroutines.\u201d presented at the ORSA\/TIMS Joint National Meeting, New York."},{"key":"3975_CR33","unstructured":"Freling, R., D. Huisman, and A.P.M. Wagelmans. (2000). \u201cModels And Algorithms For Integration Of Vehicle And Crew Scheduling.\u201d No 189 in Econometric Institute Report from Erasmus University Rotterdam, Econometric Institute."},{"issue":"9 Suppl.","key":"3975_CR34","first-page":"B49","volume":"69","author":"P.H. Gander","year":"1998","unstructured":"Gander, P.H., M.R. Rosekind, and K.B. Gregory. (1998). \u201cFlight Crew Fatigue.\u201d Aviation, Space and Environmental Medicine 69, (9 Suppl.), B49\u2013B60.","journal-title":"Aviation, Space and Environmental Medicine"},{"key":"3975_CR35","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B. Gendron","year":"1994","unstructured":"Gendron, B. and T.G. Crainic. (1994). \u201cParallel Branch-and-Bound Algoirithms: Survey and Synthesis.\u201d Operations Research 42, 1042.","journal-title":"Operations Research"},{"key":"3975_CR36","unstructured":"Gerbracht, R. (1978). \u201cA New Algorithm for Very Large Crew Pairing Problems.\u201d 18th AGIFORS Symposium, Vancouver, British Columbia, CA."},{"key":"3975_CR37","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/inte.19.4.29","volume":"19","author":"I. Gershkoff","year":"1989","unstructured":"Gershkoff, I. (1989). \u201cOptimizing Flight Crew Schedules.\u201d Interfaces 19, 29\u201343.","journal-title":"Interfaces"},{"key":"3975_CR38","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"R.E. Gomory","year":"1963","unstructured":"Gomory, R.E. (1963). \u201cAn Algorithm for Integer Solutions to Linear Programs.\u201d In R.L. Graves and P. Wolfe (eds.), Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York."},{"issue":"2","key":"3975_CR39","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10107-003-0389-3","volume":"B96","author":"R.E. Gomory","year":"2003","unstructured":"R.E. Gomory and E.L. Johnson. (2003). \u201cT-Space and Cutting Planes.\u201d Mathematical Programming Ser. B 96(2), 341\u2013375.","journal-title":"Mathematical Programming Ser."},{"issue":"2","key":"3975_CR40","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-003-0388-4","volume":"96","author":"R.E. Gomory","year":"2003","unstructured":"Gomory, R.E., E.L. Johnson, and L. Evans. (2003). \u201cCorner Polyhedra and their Applications to Cutting Planes.\u201d Mathematical Programming 96(2), 321\u2013339.","journal-title":"Mathematical Programming"},{"key":"3975_CR41","unstructured":"Gopalakrishnan, B. and E.L. Johnson. (2003). \u201cMitigating Crew Fatigue through Crew Pairing Optimization.\u201d Working Paper, School of Industrial and Systems Engineering, Georgia Tech."},{"issue":"6","key":"3975_CR42","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.39.6.736","volume":"39","author":"G.W. Graves","year":"1993","unstructured":"Graves, G.W., R.D. McBride, and I. Gershkoff. (1993). \u201cFlight Crew Scheduling.\u201d Management Science 39(6), 736\u2013745.","journal-title":"Management Science"},{"key":"3975_CR43","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held, M. and R.M. Karp. (1970). \u201cThe Travelling Salesman Problem and Minimum Spanning Tress.\u201d Oper. Res. 18, 1138\u20131162.","journal-title":"Oper. Res"},{"key":"3975_CR44","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"Held, M. and R.M. Karp. (1971). \u201cThe Travelling Salesman Problem and Minimum Spanning Tress: Part II.\u201d Mathematical Programming 1, 6\u201325.","journal-title":"Mathematical Programming"},{"key":"3975_CR45","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"Held, M., P. Wolfe, and H.P. Crowder. (1974). \u201cValidation of Subgradient Optimization.\u201d Mathematical Programming 6, 62\u201388.","journal-title":"Mathematical Programming"},{"key":"3975_CR46","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K.L. Hoffman","year":"1993","unstructured":"Hoffman, K.L. and M. Padberg. (1993). \u201cSolving Airline Crew-Scheduling Problems by Branch-and-Cut.\u201d Management Science 39, 657\u2013682.","journal-title":"Management Science"},{"key":"3975_CR47","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","volume":"6","author":"A.J Hoffman","year":"1985","unstructured":"Hoffman, A.J, A. Kolen, and M. Sakarovitch. (1985). \u201cTotally Balanced and Greedy Matrices.\u201d SIAM Journal on Algebraic and Discrete Methods 6, 721\u2013730.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"3975_CR48","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"K.L. Hoffman","year":"1991","unstructured":"Hoffman, K.L. and M. Padberg. (1991). \u201cTechniques for Improving the LP \u2212 representation of 0-1 Linear Programming Problems.\u201d ORSA J. Computing 3, 121\u2013134.","journal-title":"ORSA J. Computing"},{"key":"3975_CR49","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/inte.27.5.68","volume":"27","author":"E. Housos","year":"1997","unstructured":"Housos, E. and T. Elmroth. (1997). \u201cAutomatic Optimization of Subproblems in Schedulign Airline Crews.\u201d Interfaces 27, 68\u201377.","journal-title":"Interfaces"},{"key":"3975_CR50","unstructured":"Hu, J. (1996). \u201cSolving Linear Programs Using Primal-Dual Subproblem Simplex Method and Quasi-Explicit Matrices.\u201d Ph.D. Dissertation."},{"key":"3975_CR51","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(99)00048-6","volume":"25","author":"J. Hu","year":"1999","unstructured":"Hu, J. and E. Johnson. (1999). \u201cComputational Results with a Primal-Dual Subproblem Simplex Method.\u201d Operations Research Letters 25, 149\u2013158.","journal-title":"Operations Research Letters"},{"key":"3975_CR52","doi-asserted-by":"crossref","unstructured":"Johnson E.L. (1989). \u201cModeling and Strong Linear Programs for Mixed Integer Programming.\u201d In S.W. Wallace (ed.), Algorithms and Model Formulations in Mathematical Programming, NATO ASI Series 51, pp. 1\u201341.","DOI":"10.1007\/978-3-642-83724-1_1"},{"key":"3975_CR53","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0167-6377(98)00013-3","volume":"22","author":"M. Junger","year":"1998","unstructured":"Junger, M. and S. Thienel. (1998). \u201cIntroduction to ABACUS - A Branch-and-Cut System.\u201d Operations Research Letters 22, 83\u201395.","journal-title":"Operations Research Letters"},{"key":"3975_CR54","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(00)00017-1","volume":"27","author":"D. Klabjan","year":"2000","unstructured":"Klabjan, D., E. Johnson, and G.L. Nemhauser. (2000). \u201cA Parallel Primal-Dual Simplex Algorithm.\u201d Operations Research Letters 27, 47\u201355","journal-title":"Operations Research Letters"},{"key":"3975_CR55","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1287\/trsc.36.3.337.7831","volume":"36","author":"D. Klabjan","year":"2002","unstructured":"Klabjan, D., E. Johnson, and G.L. Nemhauser, E. Gelman, and S. Ramaswamy. (2002). \u201cAirline Crew Scheduling with Time Windows and Plane Count Constraints.\u201d Transportation Science 36, 337\u2013348.","journal-title":"Transportation Science"},{"key":"3975_CR56","unstructured":"Klabjan, D. and K. Schwan. (2002). \u201cAirline Crew Pairing Generation in Parallel.\u201d Technical report TLI\/LEC-99-02."},{"key":"3975_CR57","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1011223523191","volume":"20","author":"D. Klabjan","year":"2001","unstructured":"Klabjan, D., E. Johnson, G.L. Nemhauser, E. Gelman, and S. Ramaswamy. (2001). \u201cSolving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching.\u201d Computational Optimization and Applications 20, 73\u201391","journal-title":"Computational Optimization and Applications"},{"key":"3975_CR58","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1287\/trsc.35.4.359.10437","volume":"35","author":"D. Klabjan","year":"2001","unstructured":"Klabjan, D., E. Johnson, G.L. Nemhauser, E. Gelman, and S. Ramaswamy. (2001). \u201cAirline Crew Scheduling with Regularity.\u201d Transportation Science 35, 359\u2013374.","journal-title":"Transportation Science"},{"key":"3975_CR59","unstructured":"Larson, T. and Z. Liu. (1989). \u201cA Primal Convergence Result for Dual Subgradient Optimization with Application to Multicommodity Network Flows.\u201d Research Report S-581 83, Dept. of Math., Linkoping Institute of Technology."},{"key":"3975_CR60","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0377-2217(88)90377-3","volume":"35","author":"S. Lavoie","year":"1988","unstructured":"Lavoie, S., M. Minoux, and E. Odier. (1988). \u201cA New Approach to Crew Pairing Problems by Column Generation and Application to Air Transport.\u201d European Journal of Operatiosn Research 35, 45\u201358.","journal-title":"European Journal of Operatiosn Research"},{"key":"3975_CR61","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0120700","volume":"3","author":"T. Lemarechal","year":"1975","unstructured":"Lemarechal, T. (1975). \u201cAn Extention of Davidson Methods to Nondifferentiable Problems.\u201d Mathematical Programming Study 3, 95\u2013109.","journal-title":"Mathematical Programming Study"},{"key":"3975_CR62","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1287\/opre.19.4.998","volume":"19","author":"C. Lemke","year":"1971","unstructured":"Lemke, C., H. Salkin, K. Spielberg. (1971). \u201cSet Covering by Single Branch Enumeration with Linear Programming Subproblems.\u201d Operations Research 19, 998\u20131022.","journal-title":"Operations Research"},{"key":"3975_CR63","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1287\/opre.15.5.892","volume":"15","author":"C. Lemke","year":"1967","unstructured":"Lemke, C. and K. Spielberg. (1967). \u201cDirect Search Algorithms for Zero-One and Mixed Integer Programming.\u201dOperations Research 15, 892\u2013914.","journal-title":"Operations Research"},{"key":"3975_CR64","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"J. Linderoth","year":"1999","unstructured":"Linderoth, J. and M. Savelsbergh. (1999). \u201cA Computational Study of Search Strategies for Mixed Integer Programs.\u201d Informs Journal on Computing 11, 173\u2013187.","journal-title":"Informs Journal on Computing"},{"key":"3975_CR65","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/net.3230110208","volume":"11","author":"R.E. Marsten","year":"1981","unstructured":"Marsten, R.E. and F. Shepardson. (1981). \u201cExact Solution of Crew Problems using the Set Partitioning Mode: recent Successful Applications.\u201d Networks 11, 165\u2013177.","journal-title":"Networks"},{"key":"3975_CR66","unstructured":"Minoux, M. (1984). \u201cColumn Generation Technique in Combinatorial Optimization: A New Application to Crew Pairing Problems.\u201d Proceedings XXIVth AGIFORS Symposium."},{"key":"3975_CR67","unstructured":"Mitchell, J.E. (2000). \u201cBranch-and-Cut Algorithms for Combinatorial Optimization Problems.\u201d Handbook of Applied Operations Research, Oxford University Press."},{"key":"3975_CR68","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser, G.L. and L.A. Wolsey. (1999). \u201cInteger and Combinatorial Optimization.\u201d John Wiley, New York."},{"key":"3975_CR69","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"Padberg, M. and G. Rinaldi. (1991). \u201cA Branch-and-Cut Algorithm for the solution of Large-Scale Traveling Salesman Problems.\u201d SIAM Review 33, 1\u201341.","journal-title":"SIAM Review"},{"key":"3975_CR70","unstructured":"Padberg, M. (1971). \u201cEssays in Integer Programming.\u201d Pd.D. Thesis, GSAI, Carnegie-Mellon U., Pittsburg, PA."},{"key":"3975_CR71","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. Padberg","year":"1972","unstructured":"Padberg, M. (1972). \u201cOn the Facial Struture of the Set Packing Polyhedra.\u201d Mathematical Programming 5, 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"3975_CR72","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"M. Padberg","year":"1975","unstructured":"Padberg, M. (1975). \u201cA Note on 0-1 Programming.\u201d Operations Research 23, 833\u2013837.","journal-title":"Operations Research"},{"key":"3975_CR73","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/S0167-5060(08)70750-7","volume":"1","author":"M. Padberg","year":"1977","unstructured":"Padberg, M. (1977). \u201cOn the Complexity of Set Packing Polyhedra.\u201d Annals of Dicrete Mathematics 1, 421\u2013434.","journal-title":"Annals of Dicrete Mathematics"},{"key":"3975_CR74","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0167-5060(08)70831-8","volume":"4","author":"M. Padberg","year":"1979","unstructured":"Padberg, M. (1979). \u201cCovering, Packing and Knapsack Problems.\u201d Annals of Dicrete Mathematics 4, 265\u2013287.","journal-title":"Annals of Dicrete Mathematics"},{"key":"3975_CR75","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1019293017474","volume":"99","author":"A. Panayiotis","year":"2000","unstructured":"Panayiotis, A., P. Sanders, T. Takkula, and D. Wedelin(2000). \u201cParallel Integer Optimization for Crew Scheduling.\u201d Annals of Operations Research 99, 141\u2013166.","journal-title":"Annals of Operations Research"},{"key":"3975_CR76","unstructured":"Ralphs, T.K., L. Ladanyi, and L.E. Trotter, Jr. (2001). \u201cBranch, Cut, and Price: Sequential and Parallel.\u201d In D. Naddef and M. Juenger (eds.), Computational Combinatorial Optimization."},{"issue":"10","key":"3975_CR77","first-page":"22","volume":"63","author":"M.R. Rosekind","year":"1994","unstructured":"Rosekind, M.R., P.H. Gander, R.M. Smith, K.J. Weldon, and K.L. McNally. (1994). \u201cFatigue in Aviation.\u201d Air Line Pilot 63(10), 22\u201325.","journal-title":"Air Line Pilot"},{"key":"3975_CR78","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/0377-2217(88)90233-0","volume":"35","author":"D.M. Ryan","year":"1988","unstructured":"Ryan, D.M. and J.C. Falkner. (1988). \u201cOn the Integer Properties of Scheduling Set Paritioning Problems.\u201d European Journal of Operations Research 35, 442\u2013456.","journal-title":"European Journal of Operations Research"},{"key":"3975_CR79","unstructured":"Ryan, D.M. and B. Foster. (1981). \u201cAn Integer Programming Approach to Scheduling.\u201d In A. Wren (ed.), Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling. North-Holland, pp. 269\u2013280."},{"key":"3975_CR80","unstructured":"Rubin, J. (1971). \u201cAirline Crew Scheduling\u2014The Non-Mathematical Problem.\u201d IBM Technical Report : 320.3006."},{"key":"3975_CR81","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1287\/trsc.7.1.34","volume":"7","author":"J. Rubin","year":"1973","unstructured":"Rubin, J. (1973). \u201cA Technique for the Solution of Massive Set Covering Problems with Applications to Airline Crew Scheduling.\u201d Transportation Science 7, 34\u201338.","journal-title":"Transportation Science"},{"key":"3975_CR82","doi-asserted-by":"crossref","unstructured":"Shor, N.Z. (1985). \u201cMinimization Methods for nondifferentiable functions.\u201d Springer, Berlin.","DOI":"10.1007\/978-3-642-82118-9"},{"key":"3975_CR83","unstructured":"Vance, P.H., A. Atamturk, C. Barnhart, E. Gelman, E. Johnson, A. Krishna, D. Mahindra, G.L. Nemhauser, and R. Rebello. (1997). \u201cA Heuristic Branch-and-Price Approach and Airline Crew Pairing Problem.\u201d"},{"issue":"2","key":"3975_CR84","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/opre.45.2.188","volume":"45","author":"P.H. Vance","year":"1995","unstructured":"Vance, P.H., C. Barnhart, E.L. Johnson, and G.L. Nemhauser (1995). \u201cAirline Crew Scheduling: A New Formulation and Decomposition Algorithm.\u201d Operations Research 45(2), 188\u2013200.","journal-title":"Operations Research"},{"key":"3975_CR85","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02099703","volume":"57","author":"D. Wedelin","year":"1995","unstructured":"Wedelin, D. (1995). \u201cAn Algorithm for Large-Sclae 0-1 Integer Programming with Applications to Airline Crew Scheduling.\u201d Annals of Operations Research 57, 283\u2013301.","journal-title":"Annals of Operations Research"},{"key":"3975_CR86","unstructured":"Weir, J. (2002). \u201cA Threee Phase Approach to Solving the Crew Bidline Problem with Rules for Mitigating Crew Fatigue.\u201d Ph.D. Dissertation, Georgia Institute of Technology."},{"key":"3975_CR87","unstructured":"Wise, T.H (1995). \u201cColumn Generation and Polyhedral Combinatorics for Airline Crew Scheduling.\u201d Ph.D. Dissertation, Cornell U., Ithaca, N.Y."},{"key":"3975_CR88","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BFb0120703","volume":"3","author":"P. Wolfe","year":"1975","unstructured":"Wolfe, P. (1975). \u201cA Method of Conjugate Subgradients for Minimizing Nondifferentiable Functions.\u201d Mathematical Programming Study 3, 145\u2013173.","journal-title":"Mathematical Programming Study"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3975-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3975-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3975-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T06:12:23Z","timestamp":1586585543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3975-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":88,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["3975"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3975-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}