the multiple traveling salesman problem (mtsp) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. the objective is to minimize the total distance traveled by all the salesmen. the mtsp is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. in this paper,...

In this paper we study dynamic iteration techniques for nonlinear differential equations with mixed modification of the argument. The dynamic iteration method generalizes the well known Picard iterations, improving significantly the convergence speed of the iterative process. It also have the advantage of decoupling the part containing the modified argument so the iteration steps consist in sol...