next up previous
Next: About the Authors Up: Solving Very LargeCrew Scheduling Previous: Conclusions and Future Work


C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance.
Branch-and-price: Column generation for solving huge integer programs.
Technical Report COC-9403, Georgia Institute of Technology, Atlanta, USA, 1993.

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):276-286, 1998.

M. Desrochers and F. Soumis.
A column generation approach to the urban transit crew scheduling problem.
Transportation Science, 23(1):1-13, 1989.

C. Gervet.
Large Combinatorial Optimization Problems: a Methodology for Hybrid Models and Solutions.
In Journées Francophones de Programmation en Logique et par Contraintes, 1998.

M. L. Ginsberg.
Dynamic backtracking.
Journal of Artificial Intelligence Research, (1):25-46, 1993.

N. Guerinik and M. V. Caneghem.
Solving crew scheduling problems by constraint programming.
In Lecture Notes in Computer Science, pages 481-498, 1995.
Proceedings of the First International Conference on the Principles and Practice of Constraint Programming, CP'95.

J. Lever, M. Wallace, and B. Richards.
Constraint logic programming for scheduling and planning.
British Telecom Technical Journal, (13):73-81, 1995.

T. H. Yunes, A. V. Moura, and C. C. de Souza.
Solving large scale crew scheduling problems with constraint programming and integer programming.
Technical Report IC-99-19, Institute of Computing, University of Campinas, Brazil, 1999.