Login / Signup

Exploiting sparsity in pricing routines for the capacitated arc routing problem.

Adam N. LetchfordAmar Oukil
Published in: Comput. Oper. Res. (2009)
Keyphrases
  • high dimensional
  • memetic algorithm
  • lower bound
  • distributional assumptions
  • sparse representation
  • database
  • real time
  • sparse approximation