Pages that link to "Item:Q1577777"
From MaRDI portal
The following pages link to A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777):
Displaying 20 items.
- A Lagrangian heuristic algorithm for a public healthcare facility location problem (Q363567) (← links)
- A decomposition heuristic for the maximal covering location problem (Q606191) (← links)
- An agent-based framework for modeling and solving location problems (Q610998) (← links)
- Bayesian coverage optimization models (Q965815) (← links)
- A branch and bound algorithm for determining locations of long-term care facilities (Q976416) (← links)
- A Lagrangean heuristic for the maximal covering location problem (Q1266569) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- Multi satellites scheduling algorithm based on task merging mechanism (Q1644117) (← 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)
- Dual-based heuristics for a hierarchical covering location problem (Q1869894) (← links)
- A maximal covering location model in the presence of partial coverage (Q1881656) (← links)
- A separation based optimization approach to dynamic maximal covering location problems with switched structure (Q2031365) (← links)
- A dual bounding scheme for a territory design problem (Q2257364) (← links)
- Determining optimal police patrol areas with maximal covering and backup covering location models (Q2379709) (← links)
- Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems (Q3638852) (← links)
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← 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)
