Results 1  10
of
420,010
A BRANCHANDCUT ALGORITHM FOR THE RESOLUTION OF LARGESCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS
, 1991
"... An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the in ..."
Abstract

Cited by 204 (6 self)
 Add to MetaCart
An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull
A BranchandCut Algorithm for the Symmetric Generalized Travelling Salesman Problem
, 1995
"... We consider a variant of the classical symmetric Travelling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. This NPhard problem is known in the literature as the symmetric Generalized Travelling Salesman Problem (GT ..."
Abstract

Cited by 75 (4 self)
 Add to MetaCart
classes of facetdefining inequalities, which are used within a branchandcut algorithm for the exact solution of GTSP. Heuristic procedures are also described. Extensive computational results for instances taken from the literature and involving up to 442 nodes are reported.
Solving largescale traveling salesman problems with parallel BranchandCut
, 1995
"... We introduce the implementation of a parallel BranchandCut algorithm to solve largescale traveling salesman problems. Rather than using the wellknown models of homogeneous distribution and simple Master/Slave communication, we present a more sophisticated distribution that takes the advantage of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We introduce the implementation of a parallel BranchandCut algorithm to solve largescale traveling salesman problems. Rather than using the wellknown models of homogeneous distribution and simple Master/Slave communication, we present a more sophisticated distribution that takes the advantage
Ant Colony System: A cooperative learning approach to the traveling salesman problem
 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
, 1997
"... This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP’s. Ants cooperate using an indirect form of communication mediated by a pher ..."
Abstract

Cited by 1000 (53 self)
 Add to MetaCart
This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP’s. Ants cooperate using an indirect form of communication mediated by a
SCRIBE: A largescale and decentralized applicationlevel multicast infrastructure
 IEEE Journal on Selected Areas in Communications (JSAC
, 2002
"... This paper presents Scribe, a scalable applicationlevel multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peertopeer object location and routing substrate overlayed on the Internet, ..."
Abstract

Cited by 648 (29 self)
 Add to MetaCart
This paper presents Scribe, a scalable applicationlevel multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peertopeer object location and routing substrate overlayed on the Internet
Pastry: Scalable, distributed object location and routing for largescale peertopeer systems
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for widearea peertopeer applications. Pastry provides applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Internet. ..."
Abstract

Cited by 2063 (50 self)
 Add to MetaCart
This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for widearea peertopeer applications. Pastry provides applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Internet
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
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
Network Coding for Large Scale Content Distribution
"... We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of bloc ..."
Abstract

Cited by 497 (6 self)
 Add to MetaCart
We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling
Results 1  10
of
420,010