Polynomial algorithms for p-dispersion problems in a 2d Pareto Front.
Nicolas DupinPublished in: CoRR (2020)
Keyphrases
- optimization problems
- orders of magnitude
- np hard problems
- problems in computer vision
- data structure
- test problems
- benchmark problems
- combinatorial optimization
- machine learning
- computational cost
- data sets
- computationally efficient
- theoretical analysis
- machine learning algorithms
- multi objective
- evolutionary algorithm
- computational complexity
- practical problems
- approximate solutions
- learning algorithm
- heuristic methods
- hard problems
- computational problems
- exact algorithms
- difficult problems
- np hard
- np complete