Cooperative cover of uniform demand
From MaRDI portal
Publication:2005869
DOI10.1007/s11067-018-9429-7OpenAlexW2903867228WikidataQ128751162 ScholiaQ128751162MaRDI QIDQ2005869
Publication date: 8 October 2020
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-018-9429-7
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Covering part of a planar network
- The maximin gradual cover location problem
- Competitive location in the plane
- On the genesis of hexagonal shapes
- New approaches to circle packing in a square. With program codes.
- Generalized coverage: new developments in covering location models
- Variable neighborhood search
- The gradual covering decay location problem on a network.
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- A maximal covering location model in the presence of partial coverage
- Determining optimal police patrol areas with maximal covering and backup covering location models
- The gradual covering problem
- A stochastic gradual cover location problem
- Covering continuous demand in the plane
- The p-center location problem in an area
- Cooperative covering problems on networks
- Covering Problems
- A Simplex Method for Function Minimization
- A modified regula falsi method for computing the root of an equation
- Location Theory, Dominance, and Convexity
- The generalized maximal covering location problem