||Arabeyre, J. P., Fearnley, J., Steiger, F. C., & Teather, W., “The airline crew scheduling problem: A survey”, Transportation Science, Vol. 3 no.2, pp.140-163, 1969|
Avella, P., Boccia, M., & Sforza, A., “A penalty function heuristic for the resource constrained shortest path problem.” European Journal of Operational Research, vol. 142, no. 2, pp.221-230, 2002
Beasley JE, Christofides N. “An algorithm for the resource constrained shortest path problem.” Networks, vol. 19, pp. 379–94, 1989.
Borndörfer, R., Schelten, U., Schlechte, T., & Weider, S. “A column generation approach to airline crew scheduling.” Operation Research Proceedings, Springer Berlin Heidelberg, pp. 343-348, 2005.
Dantzig, G. B., & Wolfe, P., “Decomposition principle for linear programs.” Operations Research, vol. 8, no. 1, pp. 101-111, 1960
Desrochers, M., & Soumis, F. “A column generation approach to the urban transit crew scheduling problem.” Transportation Science, vol. 23 no.1, pp.1-13, 1989.
Dijkstra, E.W., “A note on two problems in connexion with graphs” Numerische Mathematik, pp. 269-271, 1959.
Dror M. “Note on the complexity of the shortest path models for column generation in VRPTW” vol. 42, no. 5, pp.977–8., Operations Research 1994.
Dumitrescu, I., & Boland N. “Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem.” Networks, vol. 42, no. 3, pp. 135–53, 2003.
Fu, L., Sun, D., & Rilett, L. R.,“Heuristic shortest path algorithms for transportation applications: State of the art” Computer and Operation Research vol: 33, pp. 3324-3343, 2006
Gerbracht, “A new algorithm for very large crew pairing problems” AGIFORS Proceedings, vol. 18, pp. 315–341, 1978.
Gueguen, C., Dejax, P., Gendreau, M., & Feillet, D., “An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to some Vehicle Routing Problems” Networks, vol. 44, no. 3, pp. 216-229, 2004.
Handler, GY., & Zang, I., “A dual algorithm for the constrained shortest path problem.” Networks, vol. 10, pp. 293–310, 1980.
Holmberg, K., & Yuan, D., “A multicommodity network-flow problem with side constraints on paths solved by column generation.” INFORMS Journal on Computing, vol. 15, no. 1, pp.42-57, 2003.
Ioachim, I., Gelinas, S., Soumis, F., & Desrosiers, J., “A Dynamic Programming Algorithm for the Shortest Path Problem with Time Windows and Linear Node Costs,” Networks, Vol. 31, no. 3, pp. 193-204, 1997.
Jaffe, JM. “Algorithms for finding paths with multiple constraints.” Networks, vol. 14, pp. 95–116, 1984.
Jütte, S., & Thonemann, U. W., “Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems.” European Journal of Operational Research, vol. 219, no. 2, pp. 214-223, 2012
Lavoie, S., Minoux, M., & Odier. E., “A new approach for crew pairing problems by column generation with an application to air transportation”, European Journal of Operational Research, vol. 35 no.1, pp.45-58, 1988.
Mehlhorn, K., & Ziegelmann, M., “Resource Constrained shortest paths: in: Paterson M, editor. 7th annual European Symposium on Algorithms.” Lecture notes in computer science, vol. 1879. Springer-Verlag, Berlin., pp. 326–37, 2000.
Muter, İ., Birbil, Ş. İ., Bülbül, K., Şahin, G., Yenigün, H., Taş, D., & Tüzün, D., “Solving a robust airline crew pairing problem with column generation.” Computers & Operations Research, vol. 40, no. 3, pp. 815-830, 2013.
Nemhauser G.L. and L.A. Wolsey, “Integer and Combinatorial Optimization,” John Wiley& Sons, New York, 2014.
Rasmussen, M. S., Justesen, T., Dohn, A., & Larsen, J. “The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies.” European Journal of Operational Research, vol. 219.no. 3, pp. 598-610, 2012
Ritish P.W. Oemraw, “ An Algorithm for Special Case Shortest Path Problems with Resource Constraints and Time-Based Costs” Adriana Gabor Remy Spliet, 2011
Rubin, J., “A technique for the solution of massive set covering problems, with application to airline crew scheduling”, Transportation Science, vol. 7, no.1, pp.34-48, 1973.
Vance, P., E.L. Johnson, & G.L. Nemhauser, “Airline Crew Scheduling：A NewFormulation and Decomposition Algorithm” Operations Research, vol. 45, no. 2, pp.188-200, March-April 1997.
Wolsey, L.A., “Integer Programming” Wiley, 1998
Yan, Shang-Yao, Tseng, Chih-Hwang, “An Integrated Study on Single-Fleet Routing and Flight Scheduling” Transportation Planning Journal, vol. 28, no. 4, pp.635-658, 1999