Login / Signup

Another well-solvable case of the QAP: Maximizing the job completion time variance.

Eranda ÇelaVladimir G. DeinekoGerhard J. Woeginger
Published in: Oper. Res. Lett. (2012)
Keyphrases
  • quadratic assignment problem
  • special case
  • data sets
  • database
  • databases
  • case study
  • np hard
  • np complete
  • neural network
  • real world
  • genetic algorithm
  • information systems
  • trade off