Login / Signup

A simple branching scheme for vertex coloring problems.

Stefano GualandiFederico Malucelli
Published in: Discret. Appl. Math. (2012)
Keyphrases
  • application domains
  • branch and bound
  • case study
  • data sets
  • scheduling problem
  • multi class
  • benchmark problems
  • approximation schemes