Sign in

Allocating costs in set covering problems.

Gustavo BergantiñosMaría Gómez-RúaNatividad LlorcaManuel A. PulidoJoaquín Sánchez-Soriano
Published in: Eur. J. Oper. Res. (2020)
Keyphrases
  • set covering problem
  • set covering
  • branch and bound algorithm
  • integer programming
  • column generation
  • bi objective
  • total cost
  • expected cost
  • search space
  • knapsack problem