GRASP and ILS Based Meta-Heuristic Approximation Algorithms for Optimal Virtual Network Synthesis (VNS) in Multi-AS Environment.
Yong XueAlexander BrodskyDaniel A. MenascéPublished in: ICNC (2024)
Keyphrases
- metaheuristic
- approximation algorithms
- tabu search
- optimal solution
- np hard
- worst case
- minimum cost
- variable neighborhood search
- constant factor
- simulated annealing
- ant colony optimization
- optimization problems
- genetic algorithm
- scatter search
- special case
- combinatorial optimization
- search space
- combinatorial optimization problems
- combinatorial problems
- multi start
- vehicle routing problem
- path relinking
- suboptimal solutions
- solution space
- vertex cover
- network flow
- particle swarm optimization
- feasible solution
- approximation ratio
- upper bound
- primal dual
- lower bound
- linear programming
- linear program
- branch and bound
- heuristic methods
- mixed integer
- exact algorithms
- search procedure
- dynamic programming
- evolutionary algorithm
- memetic algorithm
- column generation
- spanning tree
- mathematical programming
- scheduling problem
- branch and bound algorithm
- knapsack problem