Login / Signup

BiqBin: Moving Boundaries for NP-hard Problems by HPC.

Timotej HrgaBorut LuzarJanez PovhAngelika Wiegele
Published in: HPC (2019)
Keyphrases
  • np hard problems
  • constraint programming
  • np hard
  • knapsack problem
  • combinatorial search
  • high performance computing
  • graph coloring
  • upper bound
  • optimization problems
  • np complete