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

DOI10.1016/J.COR.2011.01.005MaRDI QIDQ716337zbMATH OpenOpenAlexFDO

Authors Oded Berman, Dmitry Krass, Jiamin Wang

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

coveringlocationnetworkoptimizationprobability

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(11)

• The gradual covering decay location problem on a network.
• A location-or-routing problem with partial and decaying coverage
• 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
• The network \(p\)-median problem with discrete probabilistic demand weights
• A multi-objective bi-level location planning problem for stone industrial parks
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• Probabilistic location problems with discrete demand weights
• The multifacility center problems with random demand weights
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights
• The ordered gradual covering location problem on a network

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)