A class of problems that can be solved using interval algorithms.
Bartlomiej Jacek KubicaPublished in: Computing (2012)
Keyphrases
- optimization problems
- benchmark problems
- convex optimization problems
- np hard problems
- learning algorithm
- np complete
- computationally efficient
- computational problems
- specific problems
- computationally hard
- difficult problems
- computational complexity
- greedy algorithms
- computational geometry
- problems in computer vision
- orders of magnitude
- machine learning algorithms
- worst case
- partial solutions
- combinatorial optimization
- exact and approximate
- hard problems
- theoretical analysis
- data mining techniques
- run times