<?xml version="1.0"?>
<!DOCTYPE rdf:RDF SYSTEM "http://dublincore.org/documents/2002/07/31/dcmes-xml/dcmes-xml-dtd.dtd" > 
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/">
 <rdf:Description>
  <dc:title>Traveling Salesperson Problem (TSP)</dc:title>
  <dc:subject>Classification/ACM: G.1.6, G.2.1, G.4</dc:subject>
  <dc:subject>CRAN Task View: Optimization (http://CRAN.R-project.org/view=Optimization)</dc:subject>
  <dc:description>Basic infrastructure and some algorithms for the traveling
salesperson problem (also traveling salesman problem; TSP).
The package provides some simple algorithms and an interface to
Concorde, the currently fastest TSP solver. Concorde itself is
not included in the package and has to be obtained separately.</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Depends: R (&gt;= 2.10.0)</dc:relation>
  <dc:relation>Suggests: maps, sp, maptools</dc:relation>
  <dc:creator>Michael Hahsler &lt;michael@hahsler.net&gt;</dc:creator>
  <dc:contributor>Michael Hahsler and Kurt Hornik</dc:contributor>
  <dc:rights>GPL-2</dc:rights>
  <dc:date>2011-11-29</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>http://CRAN.R-project.org/package=TSP</dc:identifier>
 </rdf:Description>
</rdf:RDF>

