A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms.
Jordan NininFrédéric MessinePublished in: J. Glob. Optim. (2011)
Keyphrases
- metaheuristic
- branch and bound algorithm
- combinatorial optimization
- optimal solution
- branch and bound
- combinatorial problems
- simulated annealing
- search space
- tabu search
- lower bound
- ant colony optimization
- optimization problems
- combinatorial optimization problems
- scatter search
- genetic algorithm
- search methods
- search tree
- path relinking
- test problems
- traveling salesman problem
- np hard
- vehicle routing problem
- randomly generated
- single machine scheduling problem
- particle swarm optimization
- mathematical programming
- haplotype inference
- linear program
- evolutionary algorithm
- upper bound
- knapsack problem
- mixed integer
- objective function
- variable ordering
- boolean satisfiability
- max sat
- lagrangian relaxation
- linear programming
- dynamic programming
- hill climbing
- special case
- hyper heuristics
- column generation
- search algorithm
- constraint satisfaction problems
- feasible solution