Login / Signup

An iterated-tabu-search heuristic for a variant of the partial set covering problem.

Nehme BilalPhilippe GalinierFrançois Guibault
Published in: J. Heuristics (2014)
Keyphrases
  • set covering problem
  • set covering
  • integer programming
  • branch and bound algorithm
  • column generation
  • bi objective
  • linear programming
  • branch and bound
  • optimal solution
  • multi objective
  • np hard
  • linear program