Login / Signup

An efficient mean field approach to the set covering problem.

Mattias OhlssonCarsten PetersonBo Söderberg
Published in: Eur. J. Oper. Res. (2001)
Keyphrases
  • set covering problem
  • set covering
  • column generation
  • integer programming
  • branch and bound algorithm
  • belief networks
  • bi objective
  • markov random field
  • em algorithm
  • branch and bound
  • lower bound
  • distributed databases