Capacitated facility location: separation algorithms and computational experience
Mathematical Programming: Series A and B - Special issue on computational integer programming
HubLocator: an exact solution method for the multiple allocation hub location problem
Computers and Operations Research - Location analysis
Aggregation Error Bounds for a Class of Location Models
Operations Research
Convex ordered median problem with lp-norms
Computers and Operations Research
A flexible model and efficient solution strategies for discrete location problems
Discrete Applied Mathematics
Exact algorithms for OWA-optimization in multiobjective spanning tree problems
Computers and Operations Research
Minimizing ordered weighted averaging of rational functions with applications to continuous location
Computers and Operations Research
A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems
Discrete Applied Mathematics
| Hi-index | 0.01 |
The discrete ordered median problem (DOMP) integrates classical discrete location problems, such as the N- median, N-center and Uncapacitated Facility Location problems. It was introduced by Nickel (In: Fleischmann B, Lasch R, Derigs U, Domschke W, Rieder U, editors. Operations Research Proceedings 2000, Berlin: Springer, 2001. p. 71-76), who formulated it as both a nonlinear and a linear integer program. We propose an alternative integer linear programming formulation for the DOMP, discuss relationships between both integer linear programming formulations, and show how properties of optimal solutions can be used to strengthen these formulations. Moreover, we present a specific branch and bound procedure to solve the DOMP more efficiently. We test the integer linear programming formulations and this branch and bound method computationally on randomly generated test problems.