Login / Signup

Efficiently solvable special cases of hard combinatorial optimization problems.

Rainer E. Burkard
Published in: Math. Program. (1997)
Keyphrases
  • special case
  • hard combinatorial optimization problems
  • np hard
  • benchmark problems
  • computational complexity
  • combinatorial optimization
  • ant colony optimisation
  • data mining
  • np complete
  • cellular automata