Probabilistic location problems with discrete demand weights

DOI10.1002/net.20015zbMath1103.90056OpenAlexW1994505045MaRDI QIDQ4812401

Jiamin Wang, Oded Berman

Publication date: 20 August 2004

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

minimaxnetworksmedianlocationprobabilistic weightsdiscrete weights

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Discrete location and assignment (90B80)

Related Items (11)

The network \(p\)-median problem with discrete probabilistic demand weights ⋮ Maximum probability O-D matrix estimation in large-sized networks ⋮ An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network ⋮ The multifacility center problems with random demand weights ⋮ Location Science in Canada ⋮ The \(p\)-median problem under uncertainty ⋮ The probabilistic gradual covering location problem on a network with discrete random demand weights ⋮ The β-reliable minimax and maximin location problems on a network with probabilistic weights ⋮ The stochastic \(p\)-median problem with unknown cost probability distribution ⋮ Stochastic Analysis in Location Research ⋮ A SOLUTION ALGORITHM FOR p-MEDIAN LOCATION PROBLEM ON UNCERTAIN RANDOM NETWORKS

Cites Work

• Unnamed Item

This page was built for publication: Probabilistic location problems with discrete demand weights