Exponential irreducible neighborhoods for combinatorial optimization problems.
Robert T. FirlaBianca SpilleRobert WeismantelPublished in: Math. Methods Oper. Res. (2002)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- knapsack problem
- optimization problems
- metaheuristic
- discrete optimization
- ant colony optimization
- job shop scheduling
- shortest path problem
- traveling salesman problem
- neural network
- continuous optimization problems
- evolutionary algorithm
- cost function
- minmax regret
- branch and bound
- tabu search
- particle swarm optimization
- upper bound
- lower bound
- search algorithm