{ "items" : [
    { "id" : "http://dbpedia.org/resource/Combinatorial_optimization"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "In applied mathematics and theoretical computer science, combinatorial optimization  is a topic that consists of finding an optimal object from a finite set of objects. In many such problems, exhaustive search is not feasible. It operates on the domain of those optimization problems, in which the set of feasible solutions is discrete or can be reduced to discrete, and in which the goal is to find the best solution." ] ,
        "http://xmlns.com/foaf/0.1/depiction" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/Minimum_spanning_tree.svg" ] ,
        "http://dbpedia.org/ontology/thumbnail" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/Minimum_spanning_tree.svg?width=300"] } } }
