Localizing 2‐medians on probabilistic and deterministic tree networks

DOI10.1002/NET.3230100405zbMATH Open0452.90026OpenAlexW2079420451MaRDI QIDQ3899802FDOQ3899802

Authors: 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

logisticsnetwork locationone-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)

Cited In (9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3899802)