Finding Balanced Bicliques in Bipartite Graphs Using Variable Neighborhood Search.
Juan David QuintanaJesús Sánchez-OroAbraham DuartePublished in: ICVNS (2018)
Keyphrases
- bipartite graph
- variable neighborhood search
- metaheuristic
- maximum matching
- tabu search
- heuristic methods
- graph model
- search procedure
- benchmark instances
- routing problem
- vehicle routing problem
- minimum spanning tree
- traveling salesman problem
- single machine scheduling problem
- random walk
- simulated annealing
- search space
- hybrid method
- link prediction
- feasible solution
- ant colony optimization
- multi objective
- training set