Login / Signup

A Comparison of Learnheuristics Using Different Reward Functions to Solve the Set Covering Problem.

Broderick CrawfordRicardo SotoFelipe Cisternas-CaneoDiego TapiaHanns de la Fuente MellaWenceslao PalmaJosé Lemus-RomaniMauricio CastilloMarcelo Becerra-Rozas
Published in: OLA (2021)
Keyphrases
  • set covering problem
  • set covering
  • reward function
  • branch and bound algorithm
  • column generation
  • bi objective
  • integer programming
  • optimal policy
  • learning algorithm
  • state space
  • linear program
  • network design