2001
DOI: 10.1007/3-540-44666-4_10
|View full text |Cite
|
Sign up to set email alerts
|

A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem

Abstract: We present a simple dual ascent method for the multilevel facility location problem which finds a solution within 6 times the optimum for the uncapacitated case and within 12 times the optimum for the capacitated one. The algorithm is deterministic and based on the primal-dual technique.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2002
2002
2019
2019

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 36 publications
(9 citation statements)
references
References 5 publications
0
9
0
Order By: Relevance
“…While uncapacitated doesn't consider the size of the facility, it assumes the facility could always manage the entities involved. Both capacitated and uncapacitated were considered by Bumb and March [9].…”
Section: Related Literaturementioning
confidence: 99%
“…While uncapacitated doesn't consider the size of the facility, it assumes the facility could always manage the entities involved. Both capacitated and uncapacitated were considered by Bumb and March [9].…”
Section: Related Literaturementioning
confidence: 99%
“…A simple dual ascent method for the hierarchical facility location problem is presented by Bumb and Kern (2001). The algorithm is deterministic and based on the primal-dual technique.…”
Section: Solving Algorithms For Hierarchical Location Problemmentioning
confidence: 99%
“…Aardal et al (1996) show that all non-trivial facet defining inequalities for the UFLP also define facets for the two-level uncapacitated facility location problem. Aardal et al (1999), Bumb and Kern (2001) and Zhang (2006) use ideas previously developed for the UFLP, such as dual ascent and adjustment techniques, in order to develop approximation algorithms for the MUFLP. Ageev et al (2003) present approximation algorithms with worst-case bounds for the MUFLP.…”
Section: Literature Reviewmentioning
confidence: 99%