Results 1 
8 of
8
TSP  Infrastructure for the Traveling Salesperson Problem
 JOURNAL OF STATISTICAL SOFTWARE
, 2006
"... The traveling salesperson or salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the TSP ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
(Show Context)
The traveling salesperson or salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the TSP is difficult since it belongs to the class of NPcomplete problems. The importance of the TSP arises besides from its theoretical appeal from the variety of its applications. In addition to vehicle routing, many other applications, e.g., computer wiring, cutting wallpaper, job sequencing or several data visualization techniques, require the solution of a TSP. In this paper we introduce the R package TSP which provides a basic infrastructure for handling and solving the traveling salesperson problem. The package features S3 classes for specifying a TSP and its (possibly optimal) solution as well as several heuristics to find good solutions. In addition, it provides an interface to Concorde, one of the best exact TSP solvers currently available.
Overcoming the Curse of Dimensionality in Clustering by means of the Wavelet Transform
 The Computer Journal
, 2000
"... We use a redundant wavelet transform analysis to detect clusters in highdimensional data spaces. We overcome Bellman's \curse of dimensionality" in such problems by (i) using some canonical ordering of observation and variable (document and term) dimensions in our data, (ii) applying a ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
(Show Context)
We use a redundant wavelet transform analysis to detect clusters in highdimensional data spaces. We overcome Bellman's \curse of dimensionality" in such problems by (i) using some canonical ordering of observation and variable (document and term) dimensions in our data, (ii) applying a wavelet transform to such canonically ordered data, (iii) modeling the noise in wavelet space, (iv) dening signicant component parts of the data as opposed to insignicant or noisy component parts, and (v) reading o the resultant clusters. The overall complexity of this innovative approach is linear in the data dimensionality. We describe a number of examples and test cases, including the clustering of highdimensional hypertext data. 1 Introduction Bellman's (1961) [1] \curse of dimensionality" refers to the exponential growth of hypervolume as a function of dimensionality. All problems become tougher as the dimensionality increases. Nowhere is this more evident than in problems related to ...
BioMed Central
, 2006
"... A novel approach to phylogenetic tree construction using stochastic optimization and clustering ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
A novel approach to phylogenetic tree construction using stochastic optimization and clustering
The Barycenter Heuristic and the Reorderable Matrix
, 2005
"... this paper is to discuss the role of the barycenter heuristic in ordering the rows and columns of the matrix. So far, the barycenter heuristic has been mainly used in graph drawing algorithms. In order to gain full advantage of the barycenter heuristic in ordering rows and columns of the reorderable ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
this paper is to discuss the role of the barycenter heuristic in ordering the rows and columns of the matrix. So far, the barycenter heuristic has been mainly used in graph drawing algorithms. In order to gain full advantage of the barycenter heuristic in ordering rows and columns of the reorderable matrix, we survey its use in various contexts and recall the theoretical results obtained
Introduction to TSP – Infrastructure for the Traveling Salesperson Problem
, 2009
"... ..."
(Show Context)
Article URL
, 2007
"... This Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. miRNAminer: a tool for homologous microRNA gene search BMC Bioinformatics 2008, 9:39 doi:10.1186/14712105939 ..."
Abstract
 Add to MetaCart
(Show Context)
This Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. miRNAminer: a tool for homologous microRNA gene search BMC Bioinformatics 2008, 9:39 doi:10.1186/14712105939
519a CO2 Conversion to Methanol and Ammonia Activation of Methanol Dehydrogenase Enzyme upon Methanol Binding
, 2007
"... The focus of this session is to reflect the latest advances in biocatalysis and protein engineering for biocatalysis applications. Suggested topics include, but are not limited to: (1) Biocatalyst development via protein modification, immobilization, and genetic engineering; (2) Biocatalytic reactio ..."
Abstract
 Add to MetaCart
The focus of this session is to reflect the latest advances in biocatalysis and protein engineering for biocatalysis applications. Suggested topics include, but are not limited to: (1) Biocatalyst development via protein modification, immobilization, and genetic engineering; (2) Biocatalytic reaction engineering, such as reaction kinetics and nonaqueous biocatalysis; (3) Multienzyme systems and cofactor regeneration; (4) Enzymatic bioprocessing for chemical production, biodegradation, biochemical separation/purification, fuel processing, etc.; (5) Other areas where biocatalysis plays an essential role, such as studies of energy generation systems, biosensors, and artificial cells.