Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem.
Bin HuMarkus LeitnerGünther R. RaidlPublished in: J. Heuristics (2008)
Keyphrases
- integer linear programming
- variable neighborhood search
- metaheuristic
- column generation
- minimum spanning tree
- tabu search
- traveling salesman problem
- heuristic methods
- hybrid method
- routing problem
- vehicle routing problem
- global constraints
- single machine scheduling problem
- search space
- ant colony optimization
- spanning tree
- neural network
- combinatorial optimization problems
- genetic algorithm