Differential Approximation Algorithms for Some Combinatorial Optimization Problems.
Marc DemangePascal GrisoniVangelis Th. PaschosPublished in: Theor. Comput. Sci. (1998)
Keyphrases
- approximation algorithms
- combinatorial optimization problems
- knapsack problem
- np hard
- combinatorial optimization
- optimization problems
- special case
- metaheuristic
- discrete optimization
- vertex cover
- ant colony optimization
- minimum cost
- traveling salesman problem
- worst case
- job shop scheduling
- set cover
- approximation ratio
- vehicle routing problem
- exact algorithms
- open shop
- continuous optimization problems
- min cost
- primal dual
- lower bound
- randomized algorithms
- constant factor approximation
- approximation schemes
- job shop scheduling problem
- constant factor
- evolutionary algorithm
- minmax regret
- optimal solution
- disjoint paths