An improved lower bound for the multimedian location problem

DOI10.1023/A:1020755231275MaRDI QIDQ1872010zbMATH OpenOpenAlexFDO

Authors Ranganath Nuggehalli, Timothy J. Lowe, James E. Ward

Publication date 4 May 2003

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1020755231275

zbMATH Keywords

location on networkslower boundmedian problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Integer programming (90C10)

Recommendations

• An improved bound for the multifacility location model
• Improved complexity bounds for location problems on the real line
• Improved approximation guarantees for lower-bounded facility location
• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
• Lower Bounds for the Hub Location Problem
• The multimode covering location problem
• On facility location with general lower bounds
• Lower and upper bounds for a two-level hierarchical location problem in computer networks
• Lower and upper bounds for the optimal makespan in the multimedia problem
• Computation of lower bounds on the network cost in location problems subject to distance constraints

Cited in

(4)

• 'Multidimensional' extensions and a nested dual approach for the m-median problem
• Improved complexity bounds for location problems on the real line
• Technical Note—A Generalized Bounding Method for Multifacility Location Models
• The Multimedian Location Problem on a Network Exploiting Block Structure

This page was built for publication: An improved lower bound for the multimedian location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872010)