A simple dual ascent algorithm for the multilevel facility location problem

A.F. Bumb; W. Kern

doi:10.1016/S1571-0653(05)80067-8

A simple dual ascent algorithm for the multilevel facility location problem

A.F. Bumb, W. Kern

Discrete Mathematics and Mathematical Programming

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

2 Citations (Scopus)

161 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 language	English
Title of host publication	1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Subtitle of host publication	6-8 June 2001, Cologne, Germany
Editors	Johann L. Hurink, Stefan Pickl, Hajo Broersma, Ulrich Faigle
Publisher	Elsevier
Pages	14-17
DOIs	https://doi.org/10.1016/S1571-0653(05)80067-8
Publication status	Published - 2001
Event	1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2001 - University of Cologne, Cologne, Germany Duration: 6 Jun 2001 → 8 Jun 2001 Conference number: 1

Publication series

Name	Electronic Notes in Discrete Mathematics
Publisher	Elsevier
Volume	8
ISSN (Print)	1571-0653

Workshop

Workshop	1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2001
Abbreviated title	CTW
Country/Territory	Germany
City	Cologne
Period	6/06/01 → 8/06/01

Access to Document

10.1016/S1571-0653(05)80067-8

Bumb01simpleAccepted author version, 167 KB

Cite this

Bumb, A. F., & Kern, W. (2001). A simple dual ascent algorithm for the multilevel facility location problem. In J. L. Hurink, S. Pickl, H. Broersma, & U. Faigle (Eds.), 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization: 6-8 June 2001, Cologne, Germany (pp. 14-17). (Electronic Notes in Discrete Mathematics; Vol. 8). Elsevier. https://doi.org/10.1016/S1571-0653(05)80067-8

@inbook{416868827e5c48b2ab498a4e0e803a07,

title = "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 f 2 times the optimum for the capacitated one. The algorithm is deterministic and based on the primal-dual techinique",

author = "A.F. Bumb and W. Kern",

year = "2001",

doi = "10.1016/S1571-0653(05)80067-8",

language = "English",

series = "Electronic Notes in Discrete Mathematics",

publisher = "Elsevier",

pages = "14--17",

editor = "Hurink, {Johann L.} and Stefan Pickl and Hajo Broersma and Ulrich Faigle",

booktitle = "1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization",

note = "1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2001, CTW ; Conference date: 06-06-2001 Through 08-06-2001",

}

Bumb, AF & Kern, W 2001, A simple dual ascent algorithm for the multilevel facility location problem. in JL Hurink, S Pickl, H Broersma & U Faigle (eds), 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization: 6-8 June 2001, Cologne, Germany. Electronic Notes in Discrete Mathematics, vol. 8, Elsevier, pp. 14-17, 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2001, Cologne, Germany, 6/06/01. https://doi.org/10.1016/S1571-0653(05)80067-8

A simple dual ascent algorithm for the multilevel facility location problem. / Bumb, A.F.; Kern, W.
1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization: 6-8 June 2001, Cologne, Germany. ed. / Johann L. Hurink; Stefan Pickl; Hajo Broersma; Ulrich Faigle. Elsevier, 2001. p. 14-17 (Electronic Notes in Discrete Mathematics; Vol. 8).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

TY - CHAP

T1 - A simple dual ascent algorithm for the multilevel facility location problem

AU - Bumb, A.F.

AU - Kern, W.

N1 - Conference code: 1

PY - 2001

Y1 - 2001

N2 - 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

AB - 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

U2 - 10.1016/S1571-0653(05)80067-8

DO - 10.1016/S1571-0653(05)80067-8

M3 - Chapter

T3 - Electronic Notes in Discrete Mathematics

SP - 14

EP - 17

BT - 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization

A2 - Hurink, Johann L.

A2 - Pickl, Stefan

A2 - Broersma, Hajo

A2 - Faigle, Ulrich

PB - Elsevier

T2 - 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2001

Y2 - 6 June 2001 through 8 June 2001

ER -

A simple dual ascent algorithm for the multilevel facility location problem

Abstract

Publication series

Workshop

Access to Document

Fingerprint

Cite this