A Variable Neighborhood Search heuristic for the maximum ratio clique problem.
Dominik GoekeMahdi MoeiniDavid PoganiuchPublished in: Comput. Oper. Res. (2017)
Keyphrases
- variable neighborhood search
- tabu search
- metaheuristic
- heuristic methods
- neighborhood search
- traveling salesman problem
- benchmark instances
- minimum spanning tree
- routing problem
- hybrid method
- single machine scheduling problem
- search procedure
- vehicle routing problem
- optimization problems
- simulated annealing
- path relinking
- limited discrepancy search
- exact algorithms
- genetic algorithm
- feasible solution
- combinatorial optimization problems
- evolutionary algorithm
- scatter search
- approximation algorithms
- branch and bound algorithm
- combinatorial optimization
- ant colony optimization
- lower bound
- search algorithm
- optimal solution