Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems.
Antanas ZilinskasJulius ZilinskasPublished in: Commun. Nonlinear Sci. Numer. Simul. (2015)
Keyphrases
- worst case
- optimization algorithm
- dynamic programming
- bi objective
- combinatorial optimization
- np hard
- average case
- optimal solution
- benchmark problems
- optimization problems
- learning algorithm
- objective function
- search space
- space complexity
- greedy algorithm
- shortest path problem
- minimum cost flow
- upper bound
- error bounds
- cost function
- multi objective
- linear programming
- combinatorial optimization problems
- approximation algorithms
- computationally efficient
- neural network
- genetic algorithm