The following pages link to The gradual covering problem (Q3156756):
Displaying 13 items.
- Covering part of a planar network (Q291695) (← links)
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- The maximin gradual cover location problem (Q480773) (← links)
- An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- A general global optimization approach for solving location problems in the plane (Q995943) (← links)
- The variable radius covering problem (Q1027534) (← links)
- Continuous location problems and big triangle small triangle: Constructing better bounds (Q1037367) (← links)
- The gradual covering decay location problem on a network. (Q1410306) (← links)
- A bilevel exposure-oriented sensor location problem for border security (Q1651642) (← links)
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover (Q1683144) (← links)
- Discrete cooperative coverage location models with alternative facility types in a probabilistic setting (Q6495368) (← links)