Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem.
Rafael A. MeloMichell F. QueirozCelso C. RibeiroPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- iterated local search
- vertex set
- metaheuristic
- weighted graph
- tabu search
- maximum distance
- multi start
- vehicle routing problem
- vehicle routing problem with time windows
- global optimization
- optimization problems
- undirected graph
- spanning tree
- flowshop
- scatter search
- random graphs
- optimal solution
- combinatorial optimization
- simulated annealing
- search space
- valid inequalities
- ant colony optimization
- path relinking
- genetic programming
- level set
- scheduling problem