Worst-case regret algorithms for selected optimization problems with interval uncertainty.
Jerzy JózefczykMarcin SiepakPublished in: Kybernetes (2013)
Keyphrases
- worst case
- optimization problems
- lower bound
- upper bound
- error bounds
- evolutionary algorithm
- learning algorithm
- average case
- optimization methods
- data structure
- running times
- online algorithms
- approximation algorithms
- greedy algorithm
- times faster
- computationally efficient
- combinatorial optimization
- uncertain data
- theoretical guarantees
- np hard
- expert advice
- worst case analysis
- bandit problems