Login / Signup

Parametric simplex algorithms for a class of NP-Complete problems whose average number of steps is polynomial.

Hiroshi KonnoTakahito KunoYasutoshi Yajima
Published in: Comput. Optim. Appl. (1992)
Keyphrases
  • np complete problems
  • computational complexity
  • learning algorithm
  • np complete
  • benchmark problems
  • data structure
  • genetic programming
  • combinatorial optimization
  • branch and bound
  • graph coloring
  • hard problems