Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree

DOI10.1016/0377-2217(86)90244-4zbMath0579.90025OpenAlexW1991190245MaRDI QIDQ1067987

Tom M. Cavalier, Hanif D. Sherali

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90244-4

zbMATH Keywords

chain graphp-medianminisum location-allocation problemstree-networkundirected networks

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Inventory, storage, reservoirs (90B05)

Related Items

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, Discrete equal-capacityp-median problem, Solving the 1-median problem on a network with continuous demand and demand surplus, Covering edges in networks, The minisum location problem on an undirected network with continuous link demands, The Variance Location Problem on a Network with Continuously distributed demand

Cites Work

• Unnamed Item
• Unnamed Item
• The minisum location problem on an undirected network with continuous link demands
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Optimal location of a facility relative to area demands
• Localizing 2‐medians on probabilistic and deterministic tree networks
• On Locating a Facility to Service Areas within a Network
• Locating Centers on a Tree with Discontinuous Supply and Demand Regions
• The Centers and Medians of 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