Login / Signup

A branch-and-price approach for the maximum weight independent set problem.

Deepak WarrierWilbert E. WilhelmJeffrey S. WarrenIllya V. Hicks
Published in: Networks (2005)
Keyphrases
  • independent set
  • maximum weight
  • bipartite graph
  • bipartite matching
  • minimum weight
  • partial order
  • maximum independent set
  • weighted graph
  • np hard
  • bayesian networks
  • graphical models
  • spanning tree