scientific article
From MaRDI portal
Publication:3800086
zbMath0654.05058MaRDI QIDQ3800086
Publication date: 1988
Full work available at URL: https://eudml.org/doc/31551
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple heuristic for the p-centre problem
- A heuristic for the p-center problem in graphs
- Easy and hard bottleneck location problems
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- A Best Possible Heuristic for the k-Center Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- On the computational complexity of centers locating in a graph
- The Centers and Medians of a Graph
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph