scientific article
From MaRDI portal
Publication:3783313
zbMath0642.05030MaRDI QIDQ3783313
Publication date: 1987
Full work available at URL: https://eudml.org/doc/31579
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
weighted distancep-median problemhill climbinggraph centerexchange heuristick-optimal setsp- center problem
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple heuristic for the p-centre problem
- Easy and hard bottleneck location problems
- Algorithms for the m-center problems: A survey
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- A Best Possible Heuristic for the k-Center Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- On the computational complexity of centers locating in a graph
- The Centers and Medians of a Graph
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- An Analysis of Private and Public Sector Location Models
- Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication:
