A one-step worst-case optimal algorithm for bi-objective univariate optimization.
Antanas ZilinskasPublished in: Optim. Lett. (2014)
Keyphrases
- worst case
- dynamic programming
- bi objective
- np hard
- optimization algorithm
- learning algorithm
- average case
- cost function
- upper bound
- lower bound
- optimal solution
- objective function
- multi objective
- ant colony optimization
- constant factor
- combinatorial optimization
- computationally efficient
- error bounds
- greedy algorithm
- bayesian networks
- neural network
- multi objective evolutionary algorithms
- computational complexity
- set covering problem