A dynamic edge covering and scheduling problem: complexity results and approximation algorithms.
Jiaming QiuThomas C. SharkeyPublished in: Optim. Lett. (2014)
Keyphrases
- approximation algorithms
- np hard
- scheduling problem
- worst case
- disjoint paths
- np hardness
- precedence constraints
- special case
- undirected graph
- computational complexity
- vertex cover
- minimum cost
- primal dual
- facility location problem
- single machine
- set cover
- strongly np hard
- approximation ratio
- linear programming
- randomized algorithms
- flowshop
- combinatorial auctions
- lower bound
- branch and bound algorithm
- network design problem
- open shop
- upper bound
- lagrangian relaxation
- optimal solution
- error bounds
- job shop scheduling problem
- tabu search
- linear program
- partial order
- greedy algorithm