The 1-center problem in the plane with independent random weights
From MaRDI portal
Recommendations
- A probabilistic minimax location problem on the plane
- A 1-center problem on the plane with uniformly distributed demand points
- Probabilistic location problems with discrete demand weights
- The probabilistic 1-maximal covering problem on a network with discrete demand weights
- The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions
Cites work
- scientific article; zbMATH DE number 1803764 (Why is no real title available?)
- scientific article; zbMATH DE number 5775425 (Why is no real title available?)
- scientific article; zbMATH DE number 3936253 (Why is no real title available?)
- scientific article; zbMATH DE number 34574 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 1253044 (Why is no real title available?)
- scientific article; zbMATH DE number 699423 (Why is no real title available?)
- scientific article; zbMATH DE number 3997512 (Why is no real title available?)
- scientific article; zbMATH DE number 761488 (Why is no real title available?)
- scientific article; zbMATH DE number 273667 (Why is no real title available?)
- A continuous location model for siting a non-noxious undesirable facility within a geographical region
- A note on the m-center problem with rectilinear distances
- A probabilistic minimax location problem on the plane
- A probabilistic one-centre location problem on a network
- A simple heuristic for the p-centre problem
- An Algorithm for the p-Center Problem in the Plane
- Automatic differentiation: techniques and applications
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set
- Finding Groups in Data
- Heuristic methods for thep-center problem
- Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
- Location Theory, Dominance, and Convexity
- New interval methods for constrained global optimization
- On the rectangularp-center problem
- Optimum Locations on a Graph with Probabilistic Demands
- PROFIL/BIAS - A fast interval library
- Polynomially bounded algorithms for locatingp-centers on a tree
- Probabilistic Weights in the One-Dimensional Facility Location Problem
- Rigorous global search: continuous problems
- Sensitivity analysis in continuous location models via interval analysis
- Technical Note—Extension of the Elzinga-Hearn Algorithm to the Weighted Case
- The Minimum Covering Sphere Problem
- The minimum covering \(l_{pb}\)-hypersphere problem
- The p-Centre Problem-Heuristic and Optimal Algorithms
- Using interval analysis for solving planar single-facility location problems: New discarding tests
Cited in
(7)- A Huff-like location model with quality adjustment and/or closing of existing facilities
- The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions
- scientific article; zbMATH DE number 4143134 (Why is no real title available?)
- Location equilibria for a continuous competitive facility location problem under delivered pricing
- A 1-center problem on the plane with uniformly distributed demand points
- A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations
- A probabilistic minimax location problem on the plane
This page was built for publication: The 1-center problem in the plane with independent random weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456633)
