The -reliable minimax and maximin location problems on a network with probabilistic weights

DOI10.1002/NET.20320zbMATH Open1200.90121OpenAlexW4242966713MaRDI QIDQ3057136FDOQ3057136

Authors: Jiamin Wang 

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

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

Recommendations

• The β-Reliable Median on a Network with Discrete Probabilistic Demand Weights
• Probabilistic location problems with discrete demand weights
• A probabilistic minimax location problem on the plane
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• Unreliable point facility location problems on networks

zbMATH Keywords

networkminimaxmaximinfacility locationcenter

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) 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
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Title not available (Why is that?)
• Strategic facility location: A review
• Analytical models for locating undesirable facilities
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• A probabilistic minimax location problem on the plane
• On minquantile and maxcovering optimisation
• The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions
• Optimum Locations on a Graph with Probabilistic Demands
• A note on the location of an obnoxious facility on a network
• Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
• Probabilistic location problems with discrete demand weights
• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
• Title not available (Why is that?)

Cited In (5)

• The β-Reliable Median on a Network with Discrete Probabilistic Demand Weights
• The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions
• Probabilistic location problems with discrete demand weights
• The multifacility center problems with random demand weights
• Network reliability: Heading out on the highway

This page was built for publication: The \(\beta \)-reliable minimax and maximin location problems on a network with probabilistic weights

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