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

DOI10.1016/J.COR.2011.01.005zbMATH Open1210.90041OpenAlexW1983283677MaRDI QIDQ716337FDOQ716337

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

Recommendations

• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights
• The gradual covering decay location problem on a network.
• A stochastic gradual cover location problem
• The maximin gradual cover location problem

zbMATH Keywords

networkoptimizationlocationprobabilitycovering

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• Covering location problem of emergency service facilities in an uncertain environment
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• The ordered gradual covering location problem on a network
• The minimal covering location and sizing problem in the presence of gradual cooperative coverage
• Probabilistic location problems with discrete demand weights
• The gradual covering decay location problem on a network.
• The multifacility center problems with random demand weights
• The network \(p\)-median problem with discrete probabilistic demand weights
• A multi-objective bi-level location planning problem for stone industrial parks
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights
• A location-or-routing problem with partial and decaying coverage

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

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