Directional approach to gradual cover: the continuous case
From MaRDI portal
Publication:2033708
Cites work
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- A Simplex Method for Function Minimization
- A directional approach to gradual cover
- A maximal covering location model in the presence of partial coverage
- A multi-objective heuristic approach for the casualty collection points location problem
- A new genetic algorithm for the quadratic assignment problem
- A stochastic gradual cover location problem
- An efficient genetic algorithm for the \(p\)-median problem
- Conditional median: a parametric solution concept for location problems
- Covering Problems
- Equity models in planar location
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- Generalized coverage: new developments in covering location models
- Heuristic Methods for Location-Allocation Problems
- Location Theory, Dominance, and Convexity
- Location-Allocation Problems
- Optimization by simulated annealing
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Technical Note—Conditional Location Problems on Networks
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The generalized maximal covering location problem
- The gradual covering decay location problem on a network.
- The gradual covering problem
- The maximin gradual cover location problem
This page was built for publication: Directional approach to gradual cover: the continuous case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033708)
