Login / Signup

A generic approach to proving NP-hardness of partition type problems.

Mikhail Y. KovalyovErwin Pesch
Published in: Discret. Appl. Math. (2010)
Keyphrases
  • np hardness
  • np hard
  • objective function
  • cooperative
  • lower bound
  • mixed integer