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 techinique.
| Original language | British English |
|---|---|
| Pages (from-to) | 1-4 |
| Number of pages | 4 |
| Journal | Electronic Notes in Discrete Mathematics |
| Volume | 8 |
| State | Published - 2001 |