Login / Signup

A list heuristic for vertex cover.

David AvisTomokazu Imamura
Published in: Oper. Res. Lett. (2007)
Keyphrases
  • parallel machines
  • precedence constraints
  • vertex cover
  • optimal solution
  • search algorithm
  • simulated annealing
  • tabu search
  • np hard
  • dynamic programming
  • shortest path
  • constraint satisfaction
  • mixed integer programming