An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree

DOI10.1016/0377-2217(92)90027-7zbMath0759.90058OpenAlexW2021346154MaRDI QIDQ1205700

Dilip Chhajed, Timothy J. Lowe

Publication date: 1 April 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90027-7

zbMATH Keywords

combinatorial analysisconnected networkmultimedian location problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Improved algorithms for joint optimization of facility locations and network connections ⋮ Budget constrained location problem with opening and closing of facilities.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locating facilities which interact: Some solvable cases
• A solvable case of quadratic 0-1 programming
• Localization in multifacility location theory
• Parallel concepts in graph theory
• Accumulation Point Location on Tree Networks for Guaranteed Time Distribution
• Steiner trees, partial 2–trees, and minimum IFI networks
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Characterization and Recognition of Partial 3-Trees
• Allocating programs containing branches and loops within a multiple processor system
• The Euclidean Multifacility Location Problem
• Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems
• m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
• On the Convergence of Miehle's Algorithm for the Euclidean Multifacility Location Problem
• Convex Location Problems on Tree Networks
• A Cut Approach to the Rectilinear Distance Facility Location Problem
• Distance Constraints for Tree Network Multifacility Location Problems
• The Multimedian Location Problem on a Network Exploiting Block Structure
• A note on optimality conditions for the Euclidean. Multifacility location problem

This page was built for publication: An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree