Number of the records: 1  

Possibilities of creating a distance matrix

  1. SYS0043658
    LBL
      
    00000naa-a22^^^^^7i-4500
    003
      
    CZ-HkUHK
    005
      
    20170914144858.9
    008
      
    170501s2016----xr-||||||||||-10|-0-eng-d
    040
      
    $a HKD002 $b cze $e rda
    072
      
    $2 Konspekt $a 519.1/.8 $x Kombinatorika. Teorie grafů. Matematická statistika. Operační výzkum. Matematické modelování $9 13 $T . $7 hk_us_auth*m0351408
    100
    1-
    $7 hk_us_auth*0092692 $a Macík, Martin $4 aut
    245
    10
    $a Possibilities of creating a distance matrix / $c Martin Macík, Veronika Achimská
    300
      
    $b 1 schéma, 4 tabulky
    336
      
    $a text $b txt $2 rdacontent
    337
      
    $a bez média $b n $2 rdamedia
    337
      
    $a počítač $b c $2 rdamedia
    338
      
    $a svazek $b nc $2 rdacarrier
    338
      
    $a online zdroj $b cr $2 rdacarrier
    520
    3-
    $a The high level of competition in the postal market increases the demand for the reliability of postal services and rationalization of activities (core as well supporting) related to the process of their provision, including reducing of logistic costs and as their part transport costs, too. The reduction of transport costs the post may achieve (inter alia) by optimizing the routing of postal vehicles that are used for transporting (transit) of any postal items. The presented article deals with this possibility of optimization using the graph theory. As the first task that is needed to solve in optimizing of the postal transporting process (transit process) is to identify the shortest connection (sequence) between postal stationary equipment. Based on it, the article presents methodology of creating distance matrices and searching for the shortest path distance matrix by using already existing mathematical tools and new software tools to solve large-scale tasks referring to the optimizing of postal transporting process.
    530
      
    $a Dostupné též v elektronické podobě
    650
    07
    $7 hk_us_auth*0092693 $a poštovní přeprava $2 czenas
    650
    07
    $7 hk_us_auth*0065740 $a ekonomická efektivnost $2 czenas
    650
    07
    $7 hk_us_auth*0020788 $a racionalizace $2 czenas
    650
    04
    $7 hk_us_auth*0014949 $a optimalizace
    650
    07
    $7 hk_us_auth*0013011 $a matice (matematika) $2 czenas
    655
    -4
    $7 hk_us_auth*0008276 $a články ze sborníku
    700
    1-
    $7 hk_us_auth*0092023 $a Achimská, Veronika, $d 1982- $4 aut
    773
    0-
    $w hk_us_cat*0041547 $a Hradecké ekonomické dny $t Hradec Economic Days $h 411 s. $d Hradec Králové: University of Hradec Králové, 2016 $x 2464-6059 $z 978-80-7435-634-6 $7 m2am $g S. 114-121 (tištěný sborník), s. 569-576 (online zdroj)
    856
    41
    $u http://fim2.uhk.cz/hed/data/proceedings_2016_1.pdf $y Elektronická verze
    910
      
    $a HKD002 $t rm
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.