A General Framework Based on Walsh Decomposition for Combinatorial Optimization Problems.
Imanol UnanueMaría MerinoJosé Antonio LozanoPublished in: CEC (2021)
Keyphrases
- combinatorial optimization problems
- knapsack problem
- combinatorial optimization
- optimization problems
- metaheuristic
- discrete optimization
- ant colony optimization
- job shop scheduling
- traveling salesman problem
- shortest path problem
- minmax regret
- continuous optimization problems
- decomposition method
- vehicle routing problem
- min cost
- exact algorithms
- job shop scheduling problem
- optimal solution
- neural network
- estimation of distribution algorithms
- branch and bound algorithm
- np hard
- special case
- search space