Stabilized column generation

Discrete Mathematics

Volumn 194, Issue 1-3, 1999, Pages 229-237

  Du Merle, Olivier ^a   Villeneuve, Daniel ^d   Desrosiers, Jacques ^b   Hansen, Pierre ^b,c  

^a ORANGE LABS   (France)

^b HEC MONTRÉAL   (Canada)

^c GERAD   (Canada)

^d NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000217696     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00213-1     Document Type: Article

References (23)

1. J.E. Beasley, A note on solving large p-median problems, European J. Oper. Res. 21 (1985) 270-273.
2. J.F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numer. Math. 4 (1962) 238-252.
3. J. Brimberg, P. Hansen, N. Mladenović, E.D. Taillard, Improvements and comparison of heuristics for solving the multisource Weber problem, Les Cahiers du GERAD G-97-37, Montréal, Canada, 1997.
4. P.C. Chen, P. Hansen, B. Jaumard, H. Tuy, Solution of the multisource Weber and conditional Weber problems by d.-c. programming, Oper. Res. 46 (4) (1998) 548-562.
5. G.B. Dantzig, P. Wolfe, The decomposition algorithm for linear programming, Econometrica 29 (1961) 767-778.
6. G. Desaulniers, J. Desrosiers, Y. Dumas, S. Marc, B. Rioux, F. Soumis, Crew pairing at Air France, European J. Oper. Res. 97 (1997) 245-259.
7. G. Desaulniers, J. Desrosiers, A. Lasry, M.M. Solomon, Crew pairing for a regional carrier, Proc. 7th Internat. Workshop on Computer-Aided Scheduling of Public Transport, 1997.
8. Z. Drezner, A. Mehrez, G.O. Wesolowsky, The facility location problem with limited distances, Transportation Sci. 25 (1991) 183-187.
9. R.S. Garfinkel, A.W. Neebe, M.R. Rao, An algorithm for the M-median plant location problem, Transportation Sci. 8 (1974) 217-236.
10. E.P. Gill, W. Murray, M.A. Saunders, M.H. Wright, Constrained nonlinear programming, Handbooks in Operations Research and Management Science ch. 3, vol. 21, 1989, pp. 171-210.
11. P. Hansen, B. Jaumard, S. Krau, O. du Merle, A stabilized column generation algorithm for the multisource Weber problem, Les Cahiers du GERAD, Montréal, Canada, 1998, in preparation.
12. P. Hansen, N. Mladenović, An introduction to variable neighborhood search, Les Cahiers du GERAD G-97-51, Montréal, Canada, 1997, in: S. VOSS et al. (Eds.), Proc. 2nd Internat. Conf. on Metaheuristics - MIC97, Kluwer, Dordrecht, 1998, to appear.
13. P. Hansen, N. Mladenović, Variable neighborhood search for the p-median, Les Cahiers du GERAD G-97-39, Montréal, Canada, 1998, Location Sci., to appear.
14. P. Hansen, D. Peeters, D. Richard, J.-F. Thisse, The minisum and minimax location problems revisited, Oper. Res. 33 (1985) 1251-1265.
15. J. Hiriart-Urruty, C. Lemaréchal, Convex analysis and minimization algorithms II: advanced theory and bundle methods, A Series of Comprehensive Studies in Mathematics, Springer, New York, 1993.
16. J.E. Kelley, The cutting-plane method for solving convex programs, J. SIAM 8 (1960) 703-712.
17. S. Krau, Extensions du problème de Weber, Ph.D. Dissertation, École Polytechnique de Montréal, Montréal, Canada, 1997 (in French).
18. L.S. Lasdon, Optimization Theory for Large Systems, MacMillan, New York, 1970.
19. R.E. Marsten, W.W. Hogan, J.W. Blankenship, The BOXSTEP method for large-scale optimization, Oper. Res. 23(3) (1975) 389-405.
20. N. Mladenović, P. Hansen, Variable neighborhood search, Comput. Oper. Res. 24 (1997) 1097-1100.
21. G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd, Handbooks in Operations Research and Management Science, vol. 1, Optimization, Elsevier, North-Holland, 1989.
22. K.E. Rosing, An optimal method for solving the (generalized) multi-Weber problem, European J. Oper. Res. 58 (1992) 414-426.
23. Y. Ye, Interior Point Algorithms: Theory and Analysis, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, New York, 1997.