Weighted dantzig-wolfe decomposition for linear mixed-integer programming

International Transactions in Operational Research

Volumn 4, Issue 2, 1997, Pages 151-162

  Wentges, P ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

Dantzig Wolfe decomposition; Facility location; Mixed integer programming; Optimization

Indexed keywords

EID: 0342832274     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.1997.tb00071.x     Document Type: Article

References (22)

1. Bazaraa, M. S. and Sherali, H. D. (1981) On the choice of step size in subgradient optimization. European Journal of Operational Research 7, 380-388.
2. Beasley, J. E. (1988) An algorithm for solving large scale capacitated warehouse location problems. European Journal of Operational Research 33, 314-325.
3. Cornuejols, G., Sridharan, R. and Thizy, J. M. (1991) A comparison of heuristics and relaxations for the capacitated plant location problem. European Journal of Operational Research 50, 280-297.
4. Crowder, H. (1976) Computational improvements for subgradient optimization. Symposia Mathematica 19, 357-372.
5. Dantzig, G. B. and Wolfe, P. (1960) Decomposition principle for linear programs: Operations Research 8, 101-111.
6. Dantzig, G. B. and Wolfe, P. (1961) The decomposition algorithm for linear programs. Econometrica 29(4), 767-778.
7. Fisher, M., Jaikumar, R. and Van Wassenhove, L. (1986) A multiplier adjustment method for the generalized assignment problem. Management Science 32, 1095-1103.
8. Fisher, M. L. (1981) The Lagrangian relaxation method for solving integer programming problems. Management Science 27(1), 1-18.
9. Goffin, J.-L., Haurie, A., Vial, J.-P. and Zhu, D. L. (1993) Using central prices in the decomposition of linear programs. European Journal of Operational Research 64, 593-409.
10. Guignard, M. and Opaswongkarn, K. (1990) Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems. European Journal of Operational Research 46, 73-83.
11. Guignard, M. and Rosenwein, M. B. (1989) An application-oriented guide for designing Lagrangean dual ascent algorithms. European Journal of Operational Research 43, 197-205.
12. Holmberg, K. (1992) Linear mean value cross decomposition: A generalization of the Kornai-Liptak method. European Journal of Operational Research 62, 55-73.
13. Jacobsen, S. K. (1983) Heuristics for the capacitated plant location model. European Journal ofOperational Research 12, 253-261.
14. Klose, A. (1994) A branch and bound algorithm for an uncapacitated facility location problem with a side constraint. Working Paper, IfU, University of St. Gallen.
15. Krarup, J. and Pruzan, P. M. (1983) The simple plant location problem: Survey and synthesis. European Journal of Operational Research 12, 36-81.
16. Lasdon, L. S. (1970) Optimization Theory for Large Systems. Macmillan, London.
17. Minoux, M. (1986) Mathematical Programming—Theory and Algorithms. Wiley, Chichester.
18. Nemhauser, G. L. and Wolsey, L. A. (1988) Integer and Combinatorial Optimization. Wiley, New York.
19. Van Roy, T. J. (1983) Cross decomposition for mixed integer programming. Mathematical Programming 25, 46-63.
20. Van Roy, T. J. (1986) A cross decomposition algorithm for capacitated facility location: Operations Research 34(1), 145-163.
21. Wentges, P. (1994) Standortprobleme mit Berücksichtiguny von Kapazitätsrestriktionen’. Modellierung und Lösungsverfahren. Ph.D. Thesis, University of St. Gallen.
22. Wentges, P. (1996) Accelerating Benders’ decomposition for the capacitated facility location problem. Mathematical Methods of Operations Research 44(2), 267-290.