Constraint Programming-based Column Generation
This paper surveys recent applications and advances of the Constraint Programming-based Column Generation framework, where the master subproblem is solved by traditional OR techniques, while the pricing subproblem is solved by Constraint Programming. This framework has been introduced to solve crew assignment problems, where complex regulations make the pricing subproblem demanding for traditional techniques, and then it has been applied to other contexts. The main benefits of using Constraint Programming are the expressiveness of its modeling language and the flexibility of its solvers. Recently, the Constraint Programming-based Column Generation framework has been applied to many other problems, ranging from classical combinatorial problems such as graph coloring and two dimensional bin packing, to application oriented problems, such as airline planning and resource allocation in wireless ad-hoc networks.
KeywordsColumn Generation Constraint Programming Integer linear programming
- Achterberg, T. (2007). Constraint integer programming. PhD thesis, TU Berlin. Google Scholar
- Beldiceanu, N., Carlsson, M., & Rampon, J. X. (2005). Global constraint catalogue. Technical Report SICS-T2005:08, Swedish Institute of Computer Science. Google Scholar
- Cortès, C., Gendreau, M., Rousseau, L.-M., Souyris, S., & Weintraub, A. (2012, to appear). Solving a technician dispatch problem using branch and price and constraint programming. European Journal of Operational Research. Google Scholar
- Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995). Time constrained routing and scheduling. In M. O. Ball, T. L. Magnanti, C. L. Monma, & G. L. Nemhauser (Eds.), Handbooks in operations research and management science: Vol. 8. Network routing (pp. 35–139). Amsterdam: Elsevier, North-Holland. CrossRefGoogle Scholar
- DIMACS (2002). Graph coloring instances. http://mat.gsia.cmu.edu/COLOR.
- Easton, K., Nemhauser, G. L., & Trick, M. A. (2002). Solving the travelling tournament problem: a combined integer programming and constraint programming approach. In LNCS: Vol. 2740. Proc. of practice and theory of automated timetabling (pp. 100–112). Berlin: Springer. Google Scholar
- Gecode Team (2006). Gecode: generic constraint development environment. http://www.gecode.org.
- Gendron, B., Lebbah, H., & Pesant, G. (2005). Improving the cooperation between the master problem and the subproblem in constraint programming based column generation. In LNCS: Vol. 3524. Proc. integration of AI and OR techniques in CP for combinatorial optimization problems (pp. 217–227). Berlin: Springer. CrossRefGoogle Scholar
- Harvey, W. D., & Ginsberg, M. L. (1995). Limited discrepancy search. In Proc. international joint conferences on artificial intelligence (pp. 607–615). Google Scholar
- Junker, U., Karisch, S. E., Kohl, N., Vaaben, B., Fahle, T., & Sellmann, M. (1999). A framework for constraint programming based column generation. In LNCS: Vol. 1713. Proc. principles and practice of constraint programming (pp. 261–274). Berlin: Springer. Google Scholar
- Martello, S., & Toth, P. (1990). Knapsack problems: algorithms and computer implementations. New York: Wiley Google Scholar
- Ralphs, T. K., & Ladanyi, L. (2001). COIN/BCP user’s manual. Google Scholar
- Rossi, F., Van Beek, P., & Walsh, T. (2006). Handbook of constraint programming. Amsterdam: Elsevier. Google Scholar
- Wolsey, L. A. (1998). Integer programming. New York: Wiley. Google Scholar
- Yunes, T. H., Moura, A. V., & de Souza C. C. (2000). Solving very large crew scheduling problems to optimality. In Proc. ACM symposium on applied computing (Vol. 1, pp. 446–451). New York: ACM. Google Scholar