A simple dual ascent algorithm for the multilevel facility location problem

Share/Save/Bookmark

Bumb, A.F. and Kern, W. (2001) A simple dual ascent algorithm for the multilevel facility location problem. In: 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 8 . Elsevier, pp. 14-17.

[img] PDF
Restricted to UT campus only

170kB
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 f 2 times the optimum for the capacitated one. The algorithm is deterministic and based on the primal-dual techinique
Item Type:Book Section
Copyright:© 2001 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/74507
Official URL:http://dx.doi.org/10.1016/S1571-0653(05)80067-8
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page