Directional approach to gradual cover: the continuous case
From MaRDI portal
Publication:2033708
DOI10.1007/s10287-020-00378-1OpenAlexW3097792459MaRDI QIDQ2033708
Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski
Publication date: 17 June 2021
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.03035
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- The maximin gradual cover location problem
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- Equity models in planar location
- Generalized coverage: new developments in covering location models
- The gradual covering decay location problem on a network.
- An efficient genetic algorithm for the \(p\)-median problem
- Conditional median: a parametric solution concept for location problems
- A maximal covering location model in the presence of partial coverage
- A directional approach to gradual cover
- A New Genetic Algorithm for the Quadratic Assignment Problem
- The gradual covering problem
- A multi-objective heuristic approach for the casualty collection points location problem
- Technical Note—Conditional Location Problems on Networks
- A stochastic gradual cover location problem
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- Location-Allocation Problems
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Heuristic Methods for Location-Allocation Problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Covering Problems
- A Simplex Method for Function Minimization
- Location Theory, Dominance, and Convexity
- The generalized maximal covering location problem
This page was built for publication: Directional approach to gradual cover: the continuous case
