Localizing 2‐medians on probabilistic and deterministic tree networks

DOI10.1002/net.3230100405zbMath0452.90026OpenAlexW2079420451MaRDI QIDQ3899802

Aissa Oudjit, Pitu B. Mirchandani

Publication date: 1981

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230100405

zbMATH Keywords

network locationlogisticsone-median problemsingle facility locationdeterministic tree networksimproved link-deletion algorithmprobabilistic tree networksselective enumeration algorithmtwo-median problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (9)

Determining the timing of project control points using a facility location model and simulation ⋮ Efficient algorithms for finding <scp>2‐medians</scp> of a tree ⋮ A stochastic programming approach for Shelter location and evacuation planning ⋮ Ambulance Emergency Response Optimization in Developing Countries ⋮ On worst-case aggregation analysis for network location problems ⋮ Efficient algorithms for two generalized 2-median problems and the group median problem on trees ⋮ The stochastic \(p\)-median problem with unknown cost probability distribution ⋮ Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree ⋮ 'Multidimensional' extensions and a nested dual approach for the m-median problem

This page was built for publication: Localizing 2‐medians on probabilistic and deterministic tree networks