ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition.
Christian BlumPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- variable neighborhood search
- metaheuristic
- minimum spanning tree
- tabu search
- traveling salesman problem
- routing problem
- single machine scheduling problem
- spanning tree
- hybrid method
- benchmark instances
- heuristic methods
- vehicle routing problem
- minimum cost
- search procedure
- job shop scheduling problem
- path relinking