Variable neighborhood search for the heaviest k-subgraph.
Jack BrimbergNenad MladenovicDragan UrosevicEric NgaiPublished in: Comput. Oper. Res. (2009)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- hybrid method
- path relinking
- routing problem
- minimum spanning tree
- vehicle routing problem
- search space
- single machine scheduling problem
- search procedure
- benchmark instances
- np hard
- simulated annealing
- graph databases
- optimization problems
- optimal solution
- ant colony optimization
- benchmark problems
- hybrid algorithm
- solution space
- combinatorial optimization problems
- combinatorial problems
- job shop scheduling problem
- scheduling problem
- scatter search