The probabilistic gradual covering location problem on a network with discrete random demand weights

DOI10.1016/J.COR.2011.01.005zbMath1210.90041OpenAlexW1983283677MaRDI QIDQ716337

Oded Berman, Jiamin Wang, Dmitry Krass

Publication date: 28 April 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.01.005

zbMATH Keywords

networkoptimizationcoveringprobabilitylocation

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Stochastic network models in operations research (90B15) Discrete location and assignment (90B80)

Related Items (4)

A multi-objective bi-level location planning problem for stone industrial parks ⋮ The multifacility center problems with random demand weights ⋮ The minimal covering location and sizing problem in the presence of gradual cooperative coverage ⋮ Covering location problem of emergency service facilities in an uncertain environment

Cites Work

• Unnamed Item
• The gradual covering decay location problem on a network.
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• Probabilistic location problems with discrete demand weights
• Optimum Locations on a Graph with Probabilistic Demands
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The 1-Median And 1-Antimedian Problems With Continuous Probabilistic Demand Weights

This page was built for publication: The probabilistic gradual covering location problem on a network with discrete random demand weights