A Flexible Model and Efficient Solution Strategies for Discrete Location Problems
We propose a new formulation for the Discrete Ordered Median Problem (DOMP) which has first been introduced in . For this new formulation we present several variable fixing strategies and one family of valid inequalities which are used in a specialized branch & cut procedure. Extensive computational results show that using this method, problems can be solved, which are more than twice as large as those that can be solved by existing solution approaches.
KeywordsFacility Location Solution Strategy Valid Inequality Flexible Model Specialized Branch
Unable to display preview. Download preview PDF.
- 1.N. Boland, P. Dominguez-Marin, S. Nickel, and J. Puerto, Exact procedures for solving the discrete ordered median problem, To appear in Computers and Operations Research (2005).Google Scholar
- 2.P. Dominguez-Marin, The discrete ordered median problem: Models and solution methods, Ph.D. thesis, University of Kaiserslautern, 2003.Google Scholar
- 5.S. Nickel, Discrete ordered weber problems, Operations Research Proceedings 2000, Springer Verlag, 2001, pp. 71–76.Google Scholar
- 6.S. Nickel and J. Puerto, Facility location-a unified approach, Springer Verlag, 2005.Google Scholar