Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance.
Mustapha AouchicheOdile FavaronPierre HansenPublished in: Discret. Appl. Math. (2009)
Keyphrases
- variable neighborhood search
- minimum spanning tree
- graph theory
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- routing problem
- upper bound
- hybrid method
- path relinking
- single machine scheduling problem
- social network analysis
- vehicle routing problem
- search procedure
- spanning tree
- directed graph
- ant colony optimization
- benchmark instances
- lower bound
- neural network
- weighted graph
- shortest path
- scheduling problem
- scatter search
- objective function
- social networks