The probabilistic 1-maximal covering problem on a network with discrete demand weights

DOI10.1057/palgrave.jors.2602466zbMath1155.90337OpenAlexW2038140261MaRDI QIDQ3612205

Jiamin Wang, Oded Berman

Publication date: 3 March 2009

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

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

zbMATH Keywords

networkoptimizationprobabilitylocation

Mathematics Subject Classification ID

Continuous location (90B85) Stochastic network models in operations research (90B15)

Related Items (5)

The network \(p\)-median problem with discrete probabilistic demand weights ⋮ The minmax regret gradual covering location problem on a network with incomplete information of demand weights ⋮ Generalized coverage: new developments in covering location models ⋮ The probabilistic gradual covering location problem on a network with discrete random demand weights ⋮ Stochastic Analysis in Location Research

This page was built for publication: The probabilistic 1-maximal covering problem on a network with discrete demand weights