Name
Title | ||
|---|---|---|
An acceleration of Erlenkotter-Körkel ’s algorithms for the uncapacitated facility location problem |
Abstract | ||
|---|---|---|
This contribution is focused on an acceleration of branch and bound algorithms for the uncapacitated facility location problem.
Our approach is based on the well-known Erlenkotters’ procedures and Körkels’ multi-ascent and multi-adjustment algorithms,
which have proved to be the efficient tools for solving the large-sized instances of the uncapacitated facility location problem.
These two original approaches were examined and a thorough analysis of their performance revealed how each particular procedure
contributes to the computational time of the whole algorithms. These analyses helped us to focus our effort on the most frequent
procedures. The unique contribution of this paper is a new dual ascent procedure. This procedure leads to considerable acceleration
of the lower bound computation process and reduces the resulting computational time. To demonstrate more efficient performance
of amended algorithms we present the results of extensive numerical experiments. |
Year | DOI | Venue |
|---|---|---|
2008 | https://doi.org/10.1007/s10479-008-0343-0 | Annals of Operations Research |
Keywords | Field | DocType |
Branch and bound,Uncapacitated facility location problem,Dual ascent algorithm,DualLoc,PDLoc | Branch and bound,Mathematical optimization,Dual ascent,Upper and lower bounds,Algorithm,Facility location problem,Acceleration,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
164 | 1 | 0254-5330 |
Citations | PageRank | References |
6 | 0.52 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaroslav Janácek | 1 | 19 | 7.74 |
| Lubos Buzna | 2 | 196 | 27.21 |