The network p-median problem with discrete probabilistic demand weights

DOI10.1016/J.COR.2009.10.007MaRDI QIDQ2379654zbMATH OpenOpenAlexFDO

Authors Oded Berman, Jiamin Wang

Publication date 19 March 2010

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

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

zbMATH Keywords

facility locationmediannetworkprobabilistic demand

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic location problems with discrete demand weights
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• The β-Reliable Median on a Network with Discrete Probabilistic Demand Weights
• The probabilistic gradual covering location problem on a network with discrete random demand weights
• Median problems in networks

Cites work

• A Branch and Bound Method for Integer Nonlinear Fractional Programs
• A probabilistic minimax location problem on the plane
• A probabilistic one-centre location problem on a network
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• 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
• Solution methods for thep-median problem: An annotated bibliography
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• The 1-Median And 1-Antimedian Problems With Continuous Probabilistic Demand Weights
• The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions
• The probabilistic 1-maximal covering problem on a network with discrete demand weights

Cited in

(15)

• Solving the median problem with continuous demand on a network
• A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran
• The reliable \(p\)-median problem with at-facility service
• Maximum probability O-D matrix estimation in large-sized networks
• The most probable allocation solution for the \(p\)-median problem
• The network 1-median problem with discrete demand weights and traveling times
• The β-Reliable Median on a Network with Discrete Probabilistic Demand Weights
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• The inverse 1-median problem on tree networks with variable real edge lengths
• Probabilistic location problems with discrete demand weights
• A solution algorithm for \(p\)-median location problem on uncertain random networks
• The 1-Median And 1-Antimedian Problems With Continuous Probabilistic Demand Weights
• The multifacility center problems with random demand weights
• Solving the 1-median problem on a network with continuous demand and demand surplus

This page was built for publication: The network \(p\)-median problem with discrete probabilistic demand weights

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