OVNS: Opportunistic Variable Neighborhood Search for Heaviest Subgraph Problem in Social Networks.
Ville P. SaarinenTed Hsuan Yun ChenMikko KiveläPublished in: CoRR (2023)
Keyphrases
- variable neighborhood search
- social networks
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- minimum spanning tree
- hybrid method
- vehicle routing problem
- routing problem
- social network analysis
- link prediction
- single machine scheduling problem
- path relinking
- search procedure
- benchmark instances
- search space
- graph mining
- ant colony optimization
- simulated annealing
- combinatorial optimization
- particle swarm optimization
- combinatorial optimization problems
- np hard
- evolutionary algorithm