Login / Signup

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem.

Eranda ÇelaBettina KlinzChristophe Meyer
Published in: J. Comb. Optim. (2006)
Keyphrases
  • polynomially solvable
  • np complete
  • processing times
  • np hard
  • special case
  • computationally efficient
  • minimum cost
  • makespan minimization
  • scheduling problem
  • database
  • neural network
  • case base
  • setup times