Using Confidence Limits for the Global Optimum in Combinatorial Optimization.
Ulrich DerigsPublished in: Oper. Res. (1985)
Keyphrases
- global optimum
- combinatorial optimization
- simulated annealing
- metaheuristic
- optimization method
- global convergence
- objective function
- traveling salesman problem
- combinatorial optimization problems
- trust region
- evolutionary algorithm
- branch and bound
- tabu search
- optimal solution
- optimization problems
- branch and bound algorithm
- benchmark problems
- global solution
- genetic algorithm
- faster convergence
- hybrid algorithm
- search space
- mathematical programming
- global minimum
- optimization methods
- combinatorial problems
- hard combinatorial optimization problems
- quadratic assignment problem
- neural network
- particle swarm optimization pso
- genetic algorithm ga
- single machine scheduling problem
- step size
- vehicle routing problem
- exact algorithms