Decomposability Conditions of Combinatorial Optimization Problems.
Marouene ChaiebJaber JemaiKhaled MellouliPublished in: IEA/AIE (2015)
Keyphrases
- combinatorial optimization problems
- knapsack problem
- metaheuristic
- optimization problems
- combinatorial optimization
- discrete optimization
- ant colony optimization
- shortest path problem
- sufficient conditions
- job shop scheduling
- traveling salesman problem
- continuous optimization problems
- exact algorithms
- search algorithm
- upper bound
- min cost
- simulated annealing
- scheduling problem
- estimation of distribution algorithms
- computational complexity
- clustering algorithm