Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems.
Çagin AraratSimay TekgülFirdevs UlusPublished in: SIAM J. Optim. (2023)
Keyphrases
- approximation algorithms
- optimization problems
- np hard
- quadratic program
- evolutionary algorithm
- special case
- worst case
- minimum cost
- vertex cover
- cost function
- metaheuristic
- linear programming
- facility location problem
- network design problem
- set cover
- traveling salesman problem
- approximation ratio
- approximation schemes
- exact algorithms
- np hardness
- objective function
- primal dual
- precedence constraints
- convex optimization
- knapsack problem
- combinatorial optimization
- convex programming
- combinatorial auctions
- constant factor
- randomized algorithms
- polynomial time approximation
- genetic algorithm
- disjoint paths
- approximation guarantees
- undirected graph