Pages that link to "Item:Q1273660"
From MaRDI portal
The following pages link to Computing approximate solutions of the maximum covering problem with GRASP (Q1273660):
Displayed 14 items.
- A joint replenishment inventory-location model (Q264254) (← links)
- Designing robust coverage networks to hedge against worst-case facility losses (Q617512) (← links)
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145) (← links)
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (Q764792) (← links)
- Bayesian coverage optimization models (Q965815) (← links)
- Fuzzy logic based algorithms for maximum covering location problems (Q1007856) (← links)
- Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
- On the overlap area of a disk and a piecewise circular domain (Q1725599) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case (Q2387294) (← links)
- A GRASP and path relinking heuristic for rural road network development (Q2573003) (← links)
- The leader multipurpose shopping location problem (Q2672066) (← links)
- Interactive optimization of submodular functions under matroid constraints (Q2695451) (← links)