Outer approximation algorithms for convex vector optimization problems.
Irem Nur KeskinFirdevs UlusPublished in: Optim. Methods Softw. (2023)
Keyphrases
- approximation algorithms
- optimization problems
- np hard
- evolutionary algorithm
- special case
- quadratic program
- minimum cost
- vertex cover
- worst case
- cost function
- objective function
- facility location problem
- traveling salesman problem
- exact algorithms
- metaheuristic
- convex optimization
- network design problem
- approximation ratio
- set cover
- convex hull
- open shop
- randomized algorithms
- constant factor
- disjoint paths
- np hardness
- primal dual
- approximation schemes
- knapsack problem
- precedence constraints
- greedy algorithm
- theoretical analysis
- computational complexity
- convex functions
- genetic algorithm
- combinatorial optimization