Login / Signup

A parameterized lower bounding method for the open capacitated arc routing problem.

Rafael Kendy ArakakiFábio Luiz Usberti
Published in: EURO J. Comput. Optim. (2023)
Keyphrases
  • cost function
  • support vector machine
  • pairwise
  • clustering method
  • multi step
  • decision trees
  • search algorithm
  • scheduling problem
  • lower and upper bounds
  • lower bounding