New exact algorithms for planar maximum covering location by ellipses problems.
Danilo TedeschiMarina AndrettaPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- exact algorithms
- exact solution
- knapsack problem
- heuristic methods
- computational problems
- optimization problems
- approximation algorithms
- combinatorial optimization problems
- combinatorial problems
- neural network
- benchmark instances
- np complete
- metaheuristic
- decision problems
- vehicle routing problem with time windows