Upper bounds for covering arrays by tabu search.
Kari J. NurmelaPublished in: Discret. Appl. Math. (2004)
Keyphrases
- tabu search
- upper bound
- covering arrays
- test cases
- lower bound
- simulated annealing
- metaheuristic
- context free grammars
- feasible solution
- memetic algorithm
- path relinking
- scheduling problem
- tabu search algorithm
- heuristic methods
- search algorithm
- search procedure
- hybrid algorithm
- branch and bound
- vehicle routing problem
- genetic algorithm
- multi start
- lower and upper bounds
- quadratic assignment problem
- benchmark instances
- worst case
- initial solution
- branch and bound algorithm
- scatter search
- job shop scheduling problem
- tabu list
- test set
- iterated local search
- optimization problems
- variable neighborhood search
- evolutionary algorithm
- backtracking algorithm
- combinatorial optimization
- candidate list