Due Nghia Nguyen

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Minimum Latency Problem (MLP) is a class of NP-hard combinatorial optimization problems which has many practical applications. In this paper, a general variant of MLP, also known as k-MLP is introduced. In k — MLP problem, the cost of objective function becomes the sum of waiting times at sites and k vehicles cover one of k routes. The goal is to(More)
  • 1