A probabilistic one-centre location problem on a network

DOI10.1057/PALGRAVE.JORS.2601594MaRDI QIDQ4661090zbMATH OpenOpenAlexFDO

Authors Zvi Drezner, Oded Berman

Publication date 4 April 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601594

zbMATH Keywords

computational analysislocationnetworks and graphsstochastic optimization

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Stochastic programming (90C15)

Recommendations

• A center location problem with congestion
• Localizacion sobre redes estocasticas con criterio minisum
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• Probabilistic location problems with discrete demand weights
• A stochastic location problem of k-centers on a graph

Cited in

(11)

• The network \(p\)-median problem with discrete probabilistic demand weights
• The 1-center problem in the plane with independent random weights
• Government preparedness: using simulation to prepare for a terrorist attack
• A stochastic location problem of k-centers on a graph
• Localizacion sobre redes estocasticas con criterio minisum
• On the distribution of maximum of multivariate normal random vectors
• scientific article; zbMATH DE number 5263334 (Why is no real title available?)
• The multifacility center problems with random demand weights
• A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty
• A distribution map for the one-median location problem on a network
• Network location of a reliable center using the most reliable route policy

This page was built for publication: A probabilistic one-centre location problem on a network

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