Recommendations
Cites work
- scientific article; zbMATH DE number 1803755 (Why is no real title available?)
- scientific article; zbMATH DE number 1803756 (Why is no real title available?)
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 9246 (Why is no real title available?)
- scientific article; zbMATH DE number 1253048 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 3393603 (Why is no real title available?)
- A maximal covering location model in the presence of partial coverage
- A stochastic gradual cover location problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An efficient genetic algorithm for the \(p\)-median problem
- Computation of the multivariate normal integral
- Equitable service by a facility: minimizing the Gini coefficient
- Equity measurement in facility location analysis: A review and framework
- Equity models in planar location
- Future paths for integer programming and links to artificial intelligence
- Generalized coverage: new developments in covering location models
- Locating service facilities whose reliability is distance dependent.
- Lost demand in a competitive environment
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- Orthant probabilities for the equicorrelated multivariate normal distribution
- The generalized maximal covering location problem
- The gradual covering decay location problem on a network.
- The gradual covering problem
- Transmitter location for maximum coverage and constructive-destructive interference management
Cited in
(23)- The Maximal Expected Covering Location Problem: Revisited
- A stochastic gradual cover location problem
- An exact solution framework for the multiple gradual cover location problem
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- Gradual cover competitive facility location
- Cooperative cover of uniform demand
- The ordered gradual covering location problem on a network
- Covering part of a planar network
- New variations of the maximum coverage facility location problem
- Cooperative covering problems on networks
- The minimal covering location and sizing problem in the presence of gradual cooperative coverage
- The gradual covering decay location problem on a network.
- Directional approach to gradual cover: the continuous case
- Fairness in maximal covering location problems
- A directional approach to gradual cover
- The \(p\) maximal cover -- \(p\) partial center problem on networks
- The multimode covering location problem
- The probabilistic gradual covering location problem on a network with discrete random demand weights
- Maximum coverage problem with group budget constraints
- Directional approach to gradual cover: a maximin objective
- Discrete cooperative coverage location models with alternative facility types in a probabilistic setting
- The gradual covering problem
- A two-level hierarchical nested cooperative location model
This page was built for publication: The maximin gradual cover location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480773)
