Login / Signup

Set packing relaxations of some integer programs.

Ralf BorndörferRobert Weismantel
Published in: Math. Program. (2000)
Keyphrases
  • integer program
  • np hard
  • small number
  • genetic algorithm
  • constraint satisfaction
  • packing problem
  • cutting plane
  • set covering