The minisum location problem on an undirected network with continuous link demands
From MaRDI portal
Publication:580156
DOI10.1016/0305-0548(87)90034-7zbMath0625.90025OpenAlexW2001523425MaRDI QIDQ580156
Publication date: 1987
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(87)90034-7
Related Items
Locating an n-server facility in a stochastic environment, Solving the median problem with continuous demand on a network, Capacitated, balanced, sequential location-allocation problems on chains and trees, On covering location problems on networks with edge demand, The Variance Location Problem on a Network with Continuously distributed demand, Sequential location-allocation problems on chains and trees with probabilistic link demands, Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
Cites Work
- Unnamed Item
- Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands
- Technical Note—Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming
- The Centers and Medians of a Graph
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph