Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems.
Guillaume AupyAnne BenoitPublished in: Parallel Process. Lett. (2016)
Keyphrases
- approximation algorithms
- optimization problems
- open shop
- np hard
- strongly np hard
- special case
- scheduling problem
- worst case
- cost function
- evolutionary algorithm
- vertex cover
- minimum cost
- facility location problem
- metaheuristic
- objective function
- energy minimization
- optimal solution
- knapsack problem
- flowshop
- combinatorial optimization
- set cover
- processing times
- approximation ratio
- primal dual
- randomized algorithms
- network design problem
- approximation schemes
- np hardness
- undirected graph
- lower bound
- network flow
- integer programming
- upper bound
- markov random field
- traveling salesman problem
- branch and bound algorithm