c82950

@prefix azonOnto: <http://id.e-science.pl/ontologies/azonOnto#> .
@prefix collection: <http://id.e-science.pl/vocab/collection/> .
@prefix dcterms: <http://purl.org/dc/terms/> .
@prefix kv: <http://id.e-science.pl/vocab/kv/> .
@prefix person: <http://id.e-science.pl/vocab/person/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix records: <http://id.e-science.pl/records/> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix unit: <http://id.e-science.pl/vocab/unit/> .
@prefix xml: <http://www.w3.org/XML/1998/namespace> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

kv:c82950 a skos:Concept ;
    rdfs:seeAlso "https://en.wikipedia.org/wiki/Travelling_salesman_problem"@en,
        "https://pl.wikipedia.org/wiki/Problem_komiwoja%C5%BCera"@pl ;
    skos:altLabel "TSP"@en,
        "TSP"@pl ;
    skos:definition "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 and returns to the origin city?' It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science."@en,
        "Zagadnienie optymalizacyjne, polegające na znalezieniu minimalnego cyklu Hamiltona w pełnym grafie ważonym."@pl ;
    skos:inScheme kv:keywordsVocabulary ;
    skos:prefLabel "travelling salesman problem"@en,
        "problem komiwojażera"@pl .