Login / Signup
Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem.
Najat Al-Iedani
Mhand Hifi
Toufik Saadi
Published in:
CoDIT (2016)
Keyphrases
</>
neighborhood search
simulated annealing
variable neighborhood search
heuristic methods
traveling salesman problem
path relinking
graph search
nature inspired
evolutionary algorithm
tabu search
metaheuristic
search procedure
computational intelligence
optimization problems
solution quality
vehicle routing problem