Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index.
Pierre HansenHadrien MélotPublished in: J. Chem. Inf. Comput. Sci. (2003)
Keyphrases
- variable neighborhood search
- minimum spanning tree
- graph theory
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- lower bound
- vehicle routing problem
- upper bound
- hybrid method
- single machine scheduling problem
- benchmark instances
- path relinking
- weighted graph
- ant colony optimization
- search procedure
- lower and upper bounds
- routing problem
- social network analysis
- worst case
- spanning tree
- graph structure
- simulated annealing
- graph model
- exact algorithms
- shortest path
- directed graph
- neural network