Results 1  10
of
148,044
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 the Orienteering Problem through BranchandCut
 INFORMS Journal on Computing
, 1998
"... In the Orienteering Problem (OP) we are given an undirected graph with edge weights and node prizes. The problem calls for a simple cycle whose total edge weight does not exceed a given threshold, while visiting a subset of nodes with maximum total prize. This NPhard problem arises in routing an ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
In the Orienteering Problem (OP) we are given an undirected graph with edge weights and node prizes. The problem calls for a simple cycle whose total edge weight does not exceed a given threshold, while visiting a subset of nodes with maximum total prize. This NPhard problem arises in routing
BranchandCut Algorithms for the Undirected mPeripatetic Salesman Problem
, 2003
"... In the mPeripatetic Salesman Problem (mPSP) the aim is to determine m edge disjoint Hamiltonian cycles of minimum total cost on a graph. This article describes exact branchandcut solution procedures for the undirected mPSP. Computational results are reported on random and Euclidean graphs. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In the mPeripatetic Salesman Problem (mPSP) the aim is to determine m edge disjoint Hamiltonian cycles of minimum total cost on a graph. This article describes exact branchandcut solution procedures for the undirected mPSP. Computational results are reported on random and Euclidean graphs.
A BranchandCut Algorithm for the Undirected Traveling Purchaser Problem
 Networks
, 1998
"... The purpose of this article is to present a branchandcut algorithm for the undirected Traveling Purchaser Problem which consists of determining a minimumcost route through a subset of markets, where the cost is the sum of travel and purchase costs. The problem is formulated as an integer linear p ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
The purpose of this article is to present a branchandcut algorithm for the undirected Traveling Purchaser Problem which consists of determining a minimumcost route through a subset of markets, where the cost is the sum of travel and purchase costs. The problem is formulated as an integer linear
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
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
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
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
The Viterbi algorithm
 Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract

Cited by 985 (3 self)
 Add to MetaCart
. A799A804, 1964. [9] T. C. Mo, “Theory of electrodynamics in media in noninertial frames and applications, ” J. Math. Phys., vol. 11, pp. 25892610, 1970.
Results 1  10
of
148,044