Improving the cooperation between the master problem and the subproblem in constraint programming based column generation

Lecture Notes in Computer Science

Volumn 3524, Issue , 2005, Pages 217-227

  Gendron, Bernard ^a   Lebbah, Hocine ^a,b   Pesant, Gilles ^a,b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING; SCHEDULING;

COLUMN GENERATION; CONSTRAINT PROGRAMMING (CP); SCHEDULING PROBLEMS; SEARCH STRATEGIES;

LINEAR PROGRAMMING;

EID: 26444605833     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493853_17     Document Type: Conference Paper

References (19)

1. Barnhart, C., Johnson, E.L., Nemhauser G.L., Savelsbergh, M.W.P., Vance P.H.: Branch-and-Price: Column Generation for Solving Huge Integer Programs. Operations Research 46 (1998) 316-329
2. Beaulieu, H., Ferland, J.A., Gendron, B., Michelon, P.: A Mathematical Programming Approach to Scheduling Physicians in the Emergency Room. Health Care Management Science 3 (2000) 193-200
3. Bourdais, S., Galinier, P., Pesant, G.: HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care. Principles and Practice of Constraint Programming, Proceedings of CP'03, Lecture Notes in Computer Science 2833 (2003) 153-167
4. Dantzig, G.B., Wolfe, P.: Decomposition Principle for Linear Programs. Operations Research 8 (1960) 101-111
5. Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time Constrained Routing and Scheduling. Handbooks in Operations Research and Management Science 8: Network Routing, edited by Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (1995) 35-139 (North-Holland, Amsterdam)
6. Fahle, T., Junker, U., Karish, S.E., Kohl, N., Vaaben, N., Sellmann, M.: Constraint Programming Based Column Generation for Crew Assignment. Journal of Heuristics 8 (2002) 59-81
7. Fahle, T., Sellmann, M.: Cost Based Filtering for the Constrained Knapsack Problem. Annals of Operations Research 115 (2002) 73-93
8. Gilmore, P.C., Gomory, R.E.: A Linear Programming Approach to the Cutting Stock Problem. Operations Research 9 (1961) 849-859
9. Gilmore, P.C., Gomory, R.E.: A Linear Programming Approach to the Cutting Stock Problem: Part II. Operations Research 11 (1963) 863-888
10. Junker, U., Karish, S.E., Kohl, N., Vaaben, N., Fahle, T., Sellmann, M.: A Framework for Constraint Programming Based Column Generation. Principles and Practice of Constraint Programming, Proceedings of CP'99, Lecture Notes in Computer Science 1713 (1999) 261-274
11. Lübbecke, M.E., Desrosiers, J.: Selected Topics in Column Generation. Technical Report G-2002-64, GERAD, Montréal (2002)
12. Pesant, G.: A Filtering Algorithm for the Stretch Constraint. Principles and Practice of Constraint Programming, Proceedings of CP'Ol, Lecture Notes in Computer Science 2239 (2001) 183-195
13. Régin, J.C.: Generalized Arc Consistency for Global Cardinality Constraints. Proceedings of AAAI-96 (1996) 209-215 (AAAI Press/MIT Press)
14. Rousseau, L.-M., Gendreau, M., Feillet, D.: Interior Point Stabilization for Column Generation. Publication CRT-2003-39, Centre de recherche sur les transports, Université de Montréal (2003)
15. Rousseau, L.-M., Gendreau, M., Pesant, G., Focacci, F.: Solving VRPTWs with Constraint Programming Based Column Generation. Annals of Operations Research 130 (2004) 199-216
16. Savelsbergh, M.W.P.: A Branch-and-Price Algorithm for the Generalized Assignment Problem. Operations Research 45 (1997) 831-841
17. Sellmann, M., Zervoudakis, K., Stamatopoulos, P., Fahle, T.: Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search. Annals of Operations Research 115 (2002) 207-225
18. Vanderbeck, F.: On Dantzig-Wolfe Decomposition in Integer Programming and Ways to Perform Branching in a Branch-and-Price Algorithm. Operations Research 48 111-128
19. Vanderbeck, F., Wolsey, L.A.: An Exact Algorithm for IP Column Generation. Operations Research Letters 19 151-159