A simple dual ascent algorithm for the multilevel facility location problem

A.F. Bumb, Walter Kern

Research output: Book/ReportReportProfessional

133 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 $12$ times the optimum for the capacitated one. The algorithm is deterministic and based on the primal-dual technique.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages9
ISBN (Print)0169-2690
Publication statusPublished - 2001

Publication series

NameMemorandum Faculteit TW
PublisherDepartment of Applied Mathematics, University of Twente
No.1574
ISSN (Print)0169-2690

Keywords

  • IR-65761
  • MSC-90C05
  • MSC-68W25
  • EWI-3394
  • MSC-90B80
  • METIS-200324

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

    Bumb, A. F., & Kern, W. (2001). A simple dual ascent algorithm for the multilevel facility location problem. (Memorandum Faculteit TW; No. 1574). Enschede: University of Twente, Department of Applied Mathematics.