Login / Signup

Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP.

Francesco CarrabsRaffaele CerulliRenata MansiniLorenzo MoreschiniDomenico Serra
Published in: Comput. Oper. Res. (2024)
Keyphrases
  • set covering problem
  • set covering
  • integer programming
  • branch and bound algorithm
  • column generation
  • bi objective
  • integer program
  • search algorithm
  • np hard
  • tabu search