A simple dual ascent algorithm for the multilevel facility location problem

A.F. Bumb, W. Kern

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

1 Citation (Scopus)
9 Downloads (Pure)

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
Original languageEnglish
Title of host publication1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Subtitle of host publication6-8 June 2001, Cologne, Germany
EditorsJohann L. Hurink, Stefan Pickl, Hajo Broersma, Ulrich Faigle
PublisherElsevier
Pages14-17
DOIs
Publication statusPublished - 2001
Event1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2001 - University of Cologne, Cologne, Germany
Duration: 6 Jun 20018 Jun 2001
Conference number: 1

Publication series

NameElectronic Notes in Discrete Mathematics
PublisherElsevier
Volume8
ISSN (Print)1571-0653

Workshop

Workshop1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2001
Abbreviated titleCTW
CountryGermany
CityCologne
Period6/06/018/06/01

Fingerprint Dive into the research topics of 'A simple dual ascent algorithm for the multilevel facility location problem'. Together they form a unique fingerprint.

Cite this