On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization.
Antanas ZilinskasGrazina GimbutienePublished in: Commun. Nonlinear Sci. Numer. Simul. (2016)
Keyphrases
- worst case
- bi objective
- multiple objectives
- multi objective
- multi objective optimization
- efficient solutions
- optimal design
- lower bound
- upper bound
- optimization algorithm
- average case
- dynamic programming
- network design
- pareto optimal
- set covering problem
- optimal solution
- multi objective evolutionary algorithms
- greedy algorithm
- np hard
- directed acyclic graph
- approximation algorithms
- branch and bound algorithm
- search strategies
- shortest path problem
- ad hoc networks
- genetic algorithm