Login / Signup

An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems.

Jesús Sánchez-OroAbraham Duarte
Published in: Electron. Notes Discret. Math. (2012)
Keyphrases
  • optimization problems
  • objective function
  • np complete
  • metaheuristic
  • genetic algorithm
  • benchmark problems
  • variable neighborhood search
  • neighborhood search