Solving the maximal covering location problem with heuristic concentration
From MaRDI portal
Recommendations
- The heuristic concentration-integer and its application to a class of location problems
- A Lagrangean heuristic for the maximal covering location problem
- Heuristic concentration and tabu search: A head to head comparison
- Fast heuristics for large scale covering-location problems
- An exact algorithm for the maximal covering problem
Cites work
- A gamma heuristic for the \(p\)-median problem
- A Lagrangean heuristic for the maximal covering location problem
- Heuristic concentration and tabu search: A head to head comparison
- Heuristic concentration for the p-median: An example demonstrating how and why it works
- Heuristic concentration: Two stage solution construction
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
- Testing for Vision Loss in Glaucoma Suspects
- The Maximal Covering Location Problem with Capacities on Total Workload
Cited in
(30)- Heuristic concentration and tabu search: A head to head comparison
- The time constrained maximal covering salesman problem
- Intelligent-guided adaptive search for the maximum covering location problem
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- On the overlap area of a disk and a piecewise circular domain
- A taxonomy for emergency service station location problem
- A gamma heuristic for the \(p\)-median problem
- A separation based optimization approach to dynamic maximal covering location problems with switched structure
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Covering location problem of emergency service facilities in an uncertain environment
- Upgrading edges in the maximal covering location problem
- A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
- The multimode covering location problem
- A Lagrangian heuristic algorithm for a public healthcare facility location problem
- Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods
- Data-driven robust resource allocation with monotonic cost functions
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- A practical heuristic for maximum coverage in large-scale continuous location problem
- Fast heuristics for large scale covering-location problems
- A decomposition heuristic for the maximal covering location problem
- New formulations for two location problems with interconnected facilities
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- A hybrid adaptive iterated local search heuristic for the maximal covering location problem
- Edge downgrades in the maximal covering location problem
- The cooperative maximal covering location problem with ordered partial attractions
- Benders decomposition for congested partial set covering location with uncertain demand
- Multiobjective facility location model for optimizing Arctic oil spill response
- The heuristic concentration-integer and its application to a class of location problems
- A branch and bound algorithm for determining locations of long-term care facilities
This page was built for publication: Solving the maximal covering location problem with heuristic concentration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384889)
