Some new algorithms for location problems on networks
From MaRDI portal
Publication:1291656
DOI10.1016/S0377-2217(97)00185-9zbMath0955.90060MaRDI QIDQ1291656
Publication date: 22 February 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
networksgraphslocation1-median1-centrelower-\(k\) 1-centrelower-\(k\) 1-medianupper-\(k\) 1-centreupper-\(k\) 1-median
Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (3)
Solving the absolute 1-center problem in the quickest path case ⋮ Conditional median as a robust solution concept for uncapacitated location problems ⋮ The \(k\)-centrum multi-facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A computational study of efficient shortest path algorithms
- 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
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A polynomial time algorithm for finding the absolute center of a network
- Fibonacci heaps and their uses in improved network optimization algorithms
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- An Extended Theorem for Location on a Network
- Finding the Shortest Route between Two Points in a Network
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Some new algorithms for location problems on networks