Introduction to algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Linear Time Approximation Schemes for Vehicle Scheduling
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The orienteering problem in the plane revisited
Proceedings of the twenty-second annual symposium on Computational geometry
Data harvesting with mobile elements in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved algorithms for orienteering and related problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating a vehicle scheduling problem with time windows and handling times
Theoretical Computer Science
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Iterated local search for the team orienteering problem with time windows
Computers and Operations Research
A fixed-parameter tractable algorithm for spatio-temporal calendar management
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Minimum vehicle routing with a common deadline
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Improved algorithms for orienteering and related problems
ACM Transactions on Algorithms (TALG)
Online traveling salesman problem with deadline and advanced information
Computers and Industrial Engineering
Customized tour recommendations in urban areas
Proceedings of the 7th ACM international conference on Web search and data mining
| Hi-index | 0.00 |
We study a scheduling problem in which jobs have locations. For example, consider a repairman that is supposed to visit customers at their homes. Each customer is given a time window during which the repairman is allowed to arrive. The goal is to find a schedule that visits as many homes as possible. We refer to this problem as the prize-collecting traveling salesman problem with time windows (TW-TSP).We consider two versions of TW-TSP. In the first version, jobs are located on a line, have release times and deadlines but no processing times. We present a geometric interpretation of TW-TSP on a line that generalizes the longest monotone subsequence problem. We present an O(logn) approximation algorithm for this case, where n denotes the number of jobs. This algorithm can be extended to deal with non-unit job profits.The second version deals with a general case of asymmetric distances between locations. We define a density parameter that, loosely speaking, bounds the number of zig-zags between locations within a time window. We present a dynamic programming algorithm that finds a tour that visits at least OPT/density locations during their time windows. This algorithm can be extended to deal with non-unit job profits and processing times.