Pages that link to "Item:Q2384889"
From MaRDI portal
The following pages link to Solving the maximal covering location problem with heuristic concentration (Q2384889):
Displaying 25 items.
- A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage (Q286207) (← links)
- The multimode covering location problem (Q342251) (← links)
- A Lagrangian heuristic algorithm for a public healthcare facility location problem (Q363567) (← links)
- A decomposition heuristic for the maximal covering location problem (Q606191) (← links)
- The heuristic concentration-integer and its application to a class of location problems (Q960388) (← links)
- A branch and bound algorithm for determining locations of long-term care facilities (Q976416) (← links)
- Heuristic concentration and tabu search: A head to head comparison (Q1291635) (← links)
- The time constrained maximal covering salesman problem (Q1631991) (← links)
- Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- On the overlap area of a disk and a piecewise circular domain (Q1725599) (← links)
- A taxonomy for emergency service station location problem (Q1758059) (← links)
- A gamma heuristic for the \(p\)-median problem (Q1806941) (← links)
- A separation based optimization approach to dynamic maximal covering location problems with switched structure (Q2031365) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- Covering location problem of emergency service facilities in an uncertain environment (Q2294772) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← links)
- Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods (Q4634322) (← links)
- Data-Driven Robust Resource Allocation with Monotonic Cost Functions (Q5031001) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- A practical heuristic for maximum coverage in large-scale continuous location problem (Q5080078) (← links)
- New formulations for two location problems with interconnected facilities (Q6128897) (← links)
- Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems (Q6568492) (← links)
- A hybrid adaptive iterated local search heuristic for the maximal covering location problem (Q6609706) (← links)
