Implementing mixed integer column generation

Column Generation

Volumn , Issue , 2005, Pages 331-358

  Vanderbeck, François ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84889998910     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-25486-2_12     Document Type: Chapter

References (45)

1. Briant, O., Lemaréchal, C, Meurdesoif, Ph., Michel, S., Perrot, N., and Vanderbeck, F. (2004). Comparison of bundle and classical column generation. Working paper, in preparation.
2. Briant, O. and Naddef, D. (2004). The optimal diversity management problem. Operations Research, 52:515-526.
3. Caprara, A., Fischetti, M., and Toth, P. (2000). Algorithms for the set covering problem. Annals of Operations Research, 98:308-319.
4. Chabrier, A. (2003). Generation de colonnes et de coupes utilisant des sous-problèmes de plus court chemin. Ph.D Thesis, Université d'Angers, France.
5. Cheney, E. and Goldstein, A. (1959). Newton's method for convex programming and Tchebycheff approximations. Numerische Mathematik, 1:253-268.
6. Crowder, H.P., Johnson, E.L., and Padberg, M.W. (1983). Solving' large-scale zero-one linear programming problems. Operations Research, 31: 803-834.
7. Desaulniers, G., Desrosiers, J., and Solomon, M.M. (2001). Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. In: Essays and Surveys in Metaheuristics (C.C. Ribeiro and P. Hansen, eds.), pp. 309-324, Kluwer, Boston.
8. du Merle, O. and Vial, J.-Ph. (2002). Proximal ACCPM, a cutting plane method for column generation and Lagrangian relaxation: application to the p-median. HEC/Logilab, Technical Report, 2002.23.
9. du Merle, O., Villeneuve, D., Desrosiers, J., and Hansen, P. (1999). Stabilized column generation. Discrete Mathematics, 194, 229-237.
10. Elhedhli, S. and Goffin, J.-L. (2004). The integration of interior-point cutting plane methods within branch-and-price algorithms. Mathematical Programming, 100(2):267-294.
11. Gamache, M., Soumis, F., Marquis, G., and Desrosiers, J. (1999). A column generation approach for large scale aircrew rostering problems. Operations Research, 47:247-263.
12. Geoffrion, A.M. (1974). Lagrangian relaxation for integer programming. Mathematical Programming Studies, 2:82-114.
13. Goffin, J.-L. and Vial, J.-Ph. (2002). Convex non-differentiable optimization: a survey focused on the analytic center cutting plane method, Optimization Methods and Software, 17:805-867.
14. Guignard, M. (2004). Lagrangean Relaxation. In: Handbook of Applied Optimization (M. Resende and P. Pardalos, eds.), Oxford University Press.
15. Kelley, J.E. (1960). The cutting plane method for solving convex programs. Journal of the SIAM, 8:703-712.
16. Kim, S., Chang, K.N., and Lee, J.Y. (1995). A descent method with linear programming subproblems for nondifferentiable convex optimization. Mathematical Programming, 71:17-28.
17. Ladânyi, L., Ralphs, T.K., and Trotter Jr., L.E. (1998). Branch, cut, and price: sequential and parallel. In: Computational Combinatorial Optimization (M. Junger and D. Naddef, eds.), Springer.
18. Lemaréchal, C. (1998). Lagrangian Relaxation. In: Computational Combinatorial Optimization (M. Junger and D. Naddef, eds.), Springer.
19. Lübbecke, M.E. (2001). Engine scheduling by column generation. Ph.D Thesis, Braunschweig' University of Technology, Cuvillier Verlag, Göt-tingen.
20. Lübbecke, M.E. and Desrosiers, J. (2004). Selected topics in column generation. Forthcoming in: Operations Research.
21. Marsten, R.E., Hogan, W.W., and Blankenship, J.W. (1975). The B0XSTEP method for large-scale optimization. Operations Research, 23:389-405.
22. Martin, R.K. (1987). Generating alternative mixed-integer programming models using variable redefinition. Operations Research, 35(6):820-831.
23. Michel, S. (2003). Optimisation des tournées de véhicules avec gestion des stocks. Rapport de stage, DEA, Université Bordeaux 1, France.
24. Monneris, K. (2002). Problème de production par lots: Méthode de branch-and-price. Rapport de stage, DEA, Université Bordeaux 1, France.
25. Neame, P.J. (1999). Nonsmooth dual methods in integer programming. Ph.D Thesis, Department of Mathematics and Statistics, The University of Melbourne, Australia.
26. Nemhauser, G.L. and Wolsey, L.A. (1988). Integer and Combinatorial Optimization. John Wiley & Sons, Inc.
27. Perrot, N. (2004). Advanced IP column generation strategies for the cutting stock stock problem and its variants. Ph.D Thesis, University Bordeaux 1, France.
28. Poggi de Aragâo, M. and E. Uchoa (2003). Integer program reformulation for robust branch-and-cut-and-price. In: Proceedings of the Conference Mathematical Program in Rio: A Conference in Honour of Nelson Maculan, pp. 56-61.
29. Rousseau, L.-M., Gendreau, M., and Feillet, D. (2003). Interior point stabilization for column generation. Working paper.
30. Ryan, D. M. and Foster, B.A. (1981). An integer programming' approach to scheduling. In: Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling (A. Wren, ed.), pp. 269-280, North-Holland, Amsterdam
31. Savelsbergh, M.W.P. (1994). Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing, 6:445-454.
32. Savelsbergh, M.W.P. and Nemhauser, G.L. (1991). Functional description of MINTO, a Mixed INTeger Optimizer (Version 3.0). Report COC-91-03D, Georgia Institute of Technology.
33. Savelsbergh, M.W.P. and Sol, M. (1995). The general pickup and delivery problem. Transportation Science, 29(1):17-29.
34. Taillard, E.D. (1999). A heuristic column generation method for the heterogeneous VRP. Recherche-Opérationnelle, 33:1-14.
35. Thienel, S. (1995). ABACUS-A Branch-and-cut system. Ph.D Thesis, Universität zu Köln.
36. Thizy, J.-M. (1991). Analysis of Lagrangian decomposition for the multi-item capacitated lot-sizing problem. INFOR, 29(4):271-283.
37. Valério de arvalho, J.M. (2002). Using extra dual cuts to accelerate column generation. Forthcoming in: INFORMS Journal on Computing.
38. Vanderbeck, F. (1999). Computational study of a column generation algorithm for bin packing and cutting stock problems, Mathematical Programming. Serie A, 86:565-594.
39. Vanderbeck, F. (2000). On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research, 48(1):111-128.
40. Vanderbeck, F. (2002). A generic view at the Dantzig-Wolfe decomposition approach in mixed integer programming, Working Paper, no. U-02.22, MAB, Université Bordeaux 1, France.
41. Vanderbeck, F. (2003). Automated Dantzig-Wolfe re-formulation or how to exploit simultaneously original formulation and column generation re-formulation. Working Paper, no. U-03.24, MAB, Université Bordeaux 1, France.
42. van Vyve, M. (2003). A solution approach of production planning' problems based on compact formulations of lot-sizing models. Ph.D Thesis, Université Catholique de Louvain, Belgique.
43. Vignac, B. (2003). Accélération de la convergence de l'algorithme de génération de colonne. Rapport de stage, DEA, Université Bordeaux 1, France.
44. Villeneuve, D., Desrosiers, J., Lübbecke, M.E., and Soumis, F. (2003). On compact formulations for integer programs solved by column generation. Forthcoming in: Annals of Operations Research.
45. Wentges, P. (1997). Weighted Dantzig-Wolfe decomposition for linear mixed-integer programming. Transactions in Operational Research, 4(2):151-162.