All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

ON SOME ASPECTS OF GRAPH THEORY FOR OPTIMAL TRANSPORT AMONG MARINE PORTS

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F75081431%3A_____%2F18%3A00001550" target="_blank" >RIV/75081431:_____/18:00001550 - isvavai.cz</a>

  • Alternative codes found

    RIV/60076658:12510/18:43898082

  • Result on the web

    <a href="http://sjsutst.polsl.pl/archives/2018/vol101/037_SJSUTST101_2018_Chladek_Smetanova_Krile.pdf" target="_blank" >http://sjsutst.polsl.pl/archives/2018/vol101/037_SJSUTST101_2018_Chladek_Smetanova_Krile.pdf</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.20858/sjsutst.2018.101.4" target="_blank" >10.20858/sjsutst.2018.101.4</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    ON SOME ASPECTS OF GRAPH THEORY FOR OPTIMAL TRANSPORT AMONG MARINE PORTS

  • Original language description

    This paper is devoted to the Travelling Salesman Problem as applied to Czechoslovak ocean shipping companies and their marine ports on the Black Sea. The shortest circular path around these ports is found and discussed. Formulation of the problem accounts for the fact that distances between the individual cities are not the same in both directions. The consequences that arise from this situation are studied. The used algorithms are based on graph theory and standard logistic methods. In addition, the results are compared with the results obtained by using a minimum spanning tree algorithm.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

  • Continuities

    V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Scientific Journal of Silesian University of Technology. Series Transport

  • ISSN

    0209-3324

  • e-ISSN

    2450-1549

  • Volume of the periodical

    101

  • Issue of the periodical within the volume

    2018

  • Country of publishing house

    PL - POLAND

  • Number of pages

    9

  • Pages from-to

    37-45

  • UT code for WoS article

    000475496700004

  • EID of the result in the Scopus database