The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...

One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...

Subsequence matching in time-series databases is an important problem in data mining and has attracted a lot of research interest. It is a problem of nding the data sequences containing subsequences similar to a given query sequence and of nding the oosets of these subsequences in the original data sequences. In this paper, we propose a new approach (Dual Match) to subsequence matching that exp...