Results 1  10
of
314,535
On Approximating a Geometric PrizeCollecting Traveling Salesman Problem with Time Windows
, 2003
"... 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 possi ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
as possible. We refer to this problem as the PrizeCollecting Traveling Salesman Problem with time windows (TWTSP).
unknown title
, 2003
"... www.elsevier.com/locate/jalgor On approximating a geometric prizecollecting traveling salesman problem with time windows ✩ Reuven BarYehuda a,GuyEven b, ∗ , Shimon (Moni) Shahar b ..."
Abstract
 Add to MetaCart
www.elsevier.com/locate/jalgor On approximating a geometric prizecollecting traveling salesman problem with time windows ✩ Reuven BarYehuda a,GuyEven b, ∗ , Shimon (Moni) Shahar b
Approximations of geometric prizecollecting traveling salesman problem with time windows
"... We present in this note a result by authors Reuven BarYehuda, Guy Even, and Shimon Shahar who consider 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 repai ..."
Abstract
 Add to MetaCart
the repairman is allowed to arrive. The goal is to nd a schedule that visits as many homes as possible. This problem is referred to as the prizecollecting traveling salesman problem with time windows (TWTSP). Two versions of TWTSP are considered. In the rst version, jobs are located on a line, have release
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
 In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS’96
, 1996
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c � 1 and given any n nodes in � 2, a randomized version of the scheme finds a (1 � 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes a ..."
Abstract

Cited by 399 (3 self)
 Add to MetaCart
Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c � 1 and given any n nodes in � 2, a randomized version of the scheme finds a (1 � 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 418 (21 self)
 Add to MetaCart
problems fit in this framework, including the shortest path, minimumcost spanning tree, minimumweight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
An Hybrid GRASP+VNS Metaheuristic for the PrizeCollecting Traveling Salesman Problem
"... : In the PrizeCollecting Traveling Salesman Problem (PCTSP) we have to determine a tour visiting each vertex in the graph at most one time. If a given vertex is selected then an associated prize is collected, if a vertex is unrouted a penalty must be paid. We want to minimize an objective functi ..."
Abstract
 Add to MetaCart
: In the PrizeCollecting Traveling Salesman Problem (PCTSP) we have to determine a tour visiting each vertex in the graph at most one time. If a given vertex is selected then an associated prize is collected, if a vertex is unrouted a penalty must be paid. We want to minimize an objective
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
problems occur at a critical value of such a parameter. This critical value separates two regions of characteristically different properties. For example, for Kcolorability, the critical value separates overconstrained from underconstrained random graphs, and it marks the value at which the probability
A Technique for Improving Approximation Algorithms for PrizeCollecting Problems
, 2008
"... We study the prizecollecting versions of the Steiner tree (PCST) and traveling salesman (PCTSP) problems: given a graph (V, E) with costs on each edge and a penalty on each node, the goal is to find a tree (for PCST) or cycle (for PCTSP), that minimizes the sum of the edge costs in the tree/cycle a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the prizecollecting versions of the Steiner tree (PCST) and traveling salesman (PCTSP) problems: given a graph (V, E) with costs on each edge and a penalty on each node, the goal is to find a tree (for PCST) or cycle (for PCTSP), that minimizes the sum of the edge costs in the tree
Results 1  10
of
314,535