{ "items" : [
    { "id" : "http://dbpedia.org/resource/Travelling_salesman_problem"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "The travelling salesman problem  (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.TSP is a special case of the travelling purchaser problem and the Vehicle routing problem.In the theory of computational complexity, the decision version of the TSP (where, given a length L, the task is to decide whether the graph has any tour shorter than L) belongs to the class of NP-complete problems. " ] ,
        "http://xmlns.com/foaf/0.1/depiction" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/GLPK_solution_of_a_travelling_salesman_problem.svg" ] ,
        "http://dbpedia.org/ontology/thumbnail" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/GLPK_solution_of_a_travelling_salesman_problem.svg?width=300"] } } }
