Login / Signup

An under-approximation for the robust uncertain two-level cooperative set covering problem.

Shuxin DingQi ZhangZhiming Yuan
Published in: CDC (2020)
Keyphrases
  • set covering problem
  • cooperative
  • set covering
  • branch and bound algorithm
  • column generation
  • integer programming
  • pareto local search
  • bi objective
  • robust stability
  • multi agent
  • np hard
  • resource allocation