Results 11  20
of
127
The Domino Inequalities: Facets for the Symmetric Traveling Salesman Polytope
, 2003
"... Adam Letchford defines in [4] the Domino Parity inequalities for the Symmetric Traveling Salesman Polytope (STSP) and gives a polynomial algorithm for the separation of such constraints when the support graph is planar, generalizing a result of Fleischer and Tardos [2] for maximally violated com ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Adam Letchford defines in [4] the Domino Parity inequalities for the Symmetric Traveling Salesman Polytope (STSP) and gives a polynomial algorithm for the separation of such constraints when the support graph is planar, generalizing a result of Fleischer and Tardos [2] for maximally violated
DOI: 10.1016/j.cor.2009.05.004 A Memetic Algorithm with a Large Neighborhood Crossover Operator for the Generalized Traveling Salesman Problem
, 2009
"... The Generalized Traveling Salesman Problem (GTSP) is a generalization of the wellknown Traveling Salesman Problem (TSP), in which the set of cities is divided into mutually exclusive clusters. The objective of the GTSP consists in visiting each cluster exactly once in a tour, while minimizing the s ..."
Abstract
 Add to MetaCart
The Generalized Traveling Salesman Problem (GTSP) is a generalization of the wellknown Traveling Salesman Problem (TSP), in which the set of cities is divided into mutually exclusive clusters. The objective of the GTSP consists in visiting each cluster exactly once in a tour, while minimizing
1The Generalized TwoSided Power Distribution
"... Abstract. The Generalized Standard TwoSided Power (TSP) distribution was mentioned only in passing by van Dorp and Kotz (2004). In this paper we shall further investigate this threeparameter distribution by presenting some novel properties and use its more general form to contrast the chronology o ..."
Abstract
 Add to MetaCart
of developments of various authors on the twoparameter TwoSided Power distribution since its initial introduction. GTSP distributions also allow for Jshaped forms of its pdf, whereas TSP distributions are limited to Ushaped and unimodal forms. Hence, GTSP distributions allow for the same three distributional
unknown title
"... Fidelity will create and operate the prototype Galileo Time Service Provider (GTSP) to deliver Coordinated Universal Time (UTC) services to the Galileo satellite system in time for its InOrbit Validation due in 2008. A key element of this plan is to integrate the Galileo System Time into the wider ..."
Abstract
 Add to MetaCart
Fidelity will create and operate the prototype Galileo Time Service Provider (GTSP) to deliver Coordinated Universal Time (UTC) services to the Galileo satellite system in time for its InOrbit Validation due in 2008. A key element of this plan is to integrate the Galileo System Time into the wider
Gradient Clock Synchronization in Wireless Sensor Networks
"... Accurately synchronized clocks are crucial for many applications in sensor networks. Existing time synchronization algorithms provide on average good synchronization between arbitrary nodes, however, as we show in this paper, closeby nodes in a network may be synchronized poorly. We propose the Gra ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
the Gradient Time Synchronization Protocol (GTSP) which is designed to provide accurately synchronized clocks between neighbors. GTSP works in a completely decentralized fashion: Every node periodically broadcasts its time information. Synchronization messages received from direct neighbors are used
THE GRAPHICAL TRAVELING SALESMAN POLYHEDRON IS THE INTERSECTION OF THE POSITIVE ORTHANT WITH THE MINKOWSKI SUM OF THE SYMMETRIC TRAVELING SALESMAN POLYTOPE AND THE POLAR OF THE METRIC CONE
, 2008
"... In this short communication, we observe that the Graphical Traveling Salesman Polyhedron is the intersection of the positive orthant with the Minkowski sum of the Symmetric Traveling Salesman Polytope and the polar of the metric cone. This follows trivially from known facts. There are two reasons wh ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this short communication, we observe that the Graphical Traveling Salesman Polyhedron is the intersection of the positive orthant with the Minkowski sum of the Symmetric Traveling Salesman Polytope and the polar of the metric cone. This follows trivially from known facts. There are two reasons
A Hybrid Heuristic Approach for Solving the Generalized Traveling Salesman Problem
"... The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking for a minimum Hamiltonian tour visiting exactly one node from each cluster. In this paper, we combine the consultantguided ..."
Abstract
 Add to MetaCart
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking for a minimum Hamiltonian tour visiting exactly one node from each cluster. In this paper, we combine the consultant
An Antbased Technique for the Dynamic Generalized Traveling Salesman Problem
"... Abstract: In this paper we present an effective metaheuristic algorithm based on ant colony system in the case of the dynamic generalized traveling salesman problem. The same technique can be used for other dynamic large scale NPhard problems encountered in telecommunications, transportation, netwo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: In this paper we present an effective metaheuristic algorithm based on ant colony system in the case of the dynamic generalized traveling salesman problem. The same technique can be used for other dynamic large scale NPhard problems encountered in telecommunications, transportation, network design, etc. In the dynamic versions that we consider, if we look at the distance between nodes as travel times they are no longer fixed. Computational results are reported in the case of dynamic generalized traveling salesman problem for some real data sets. KeyWords: ant colony algorithms, generalized traveling salesman problem 1
Graph learning with a nearest neighbor approach
 In Proceedings of the Conference on Computational Learning Theory
, 1996
"... In this paper, we study how to traverse all edges of an unknown graph G =(V; E) that is bidirected and strongly connected. This problem can be solved with a simple algorithm that traverses all edges at most twice, and no algorithm can do better in the worst case. Artificial Intelligence researchers ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
In this paper, we study how to traverse all edges of an unknown graph G =(V; E) that is bidirected and strongly connected. This problem can be solved with a simple algorithm that traverses all edges at most twice, and no algorithm can do better in the worst case. Artificial Intelligence researchers, however, often use the following online nearest neighbor algorithm: “repeatedly take a shortest path to the closest unexplored edge and traverse it. ” We prove bounds on the worstcase complexity of this algorithm. We show, for example, that its worstcase complexity is close to optimal for some classes of graphs, such as graphs with linear or star topology and dense graphs with edge lengths one. In general, however, its complexity can grow faster than linear in the sum of all edge lengths, although not faster than log(V) times the sum of all edge lengths. 1
Results 11  20
of
127