scientific article; zbMATH DE number 4045779

MaRDI QIDQ3783313zbMATH OpenFDO

Authors Ján Plesník

Publication date 1987

Full work available at URL https://eudml.org/doc/31579

zbMATH Keywords

exchange heuristicgraph centerhill climbingk-optimal setsp- center problemp-median problemweighted distance

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A heuristic for the p-center problem in graphs
• A simple heuristic for the p-centre problem
• scientific article; zbMATH DE number 4066949
• scientific article; zbMATH DE number 3960894
• scientific article; zbMATH DE number 1670650

Cites work

• A Best Possible Heuristic for the k-Center Problem
• A simple heuristic for the p-centre problem
• Algorithms for the m-center problems: A survey
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An Analysis of Private and Public Sector Location Models
• Easy and hard bottleneck location problems
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• scientific article; zbMATH DE number 3887396 (Why is no real title available?)
• scientific article; zbMATH DE number 3666528 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 3312524 (Why is no real title available?)
• On the computational complexity of centers locating in a graph
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• 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
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
• The Centers and Medians of a Graph

Cited in

(7)

• Lexicographic local search and the \(p\)-center problem.
• Closed 3-stop center and periphery in graphs
• Optimizing budget allocation for center and median points
• scientific article; zbMATH DE number 3918404 (Why is no real title available?)
• scientific article; zbMATH DE number 4066949 (Why is no real title available?)
• scientific article; zbMATH DE number 125459 (Why is no real title available?)
• scientific article; zbMATH DE number 4128387 (Why is no real title available?)

This page was built for publication:

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