Login / Signup

An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems.

Saman EskandarzadehReza Tavakkoli-MoghaddamAmir Azaron
Published in: J. Comb. Optim. (2009)
Keyphrases
  • relaxation algorithm
  • special case
  • linear relaxation
  • np hard
  • relaxation labeling
  • computational complexity
  • lot sizing
  • linear program
  • regularized least squares
  • routing problem
  • lagrangian relaxation