An instance of the curve reconstruction problem is a finite sample set V of an unknown collection of curves γ. The task is to connect the points in V in the order in which they lie on γ. Giesen [Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SCG ’99), 1999, pp. 207–216] showed recently that the traveling salesman tour of V solves the reconstruction problem for single cl...

In this paper the problem of eeciently serving a sequence of requests that are presented in a metric space in an on-line fashion and then returning back to the departure point is considered. The problem, that is the on-line version of a variant of the Traveling Salesman Problem (namely the Vehicle Routing Problem with release times), and that for the sake of intuition we call On-Line Traveling ...

We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to visit a set of cities while minimizing the length of the overall tour. In the PCTSP, each city has a given weight and penalty, and the goal is to collect a given quota of the weights of the cities while minimizing the l...

Local search heuristics are among the most popular approaches to solve hard optimization problems. Among them, Very Large Scale Neighborhood Search techniques present a good balance between the quality of local optima and the time to search a neighborhood. We develop a language to generate exponentially large neighborhoods for sequencing problems using grammars. We develop efficient generic dyn...

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...