The Variance Location Problem on a Network with Continuously distributed demand
From MaRDI portal
Recommendations
Cites work
- A note on locating a central vertex of a 3-cactus graph
- An algorithm for the minimum variance point of a network
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 279289 (Why is no real title available?)
- Locating a Point of Minimum Variance on Triangular Graphs
- Mean-Variance Location Problems
- Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
- Network Median Problems with Continuously Distributed Demand
- 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
- Solving Nonlinear Single-Facility Network Location Problems
- The m-Center Problem: Minimax Facility Location
- The minisum location problem on an undirected network with continuous link demands
Cited in
(6)- Improved algorithms for several network location problems with equality measures.
- Solving the median problem with continuous demand on a network
- Mean and mean square location models along a coordinate line
- scientific article; zbMATH DE number 1323027 (Why is no real title available?)
- Solving the 1-median problem on a network with continuous demand and demand surplus
- The path-variance problem on tree networks
This page was built for publication: The Variance Location Problem on a Network with Continuously distributed demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4497891)
