Zobrazeno 1 - 10
of 51
pro vyhledávání: '"celočíselné programování"'
Autor:
Horák, Filip
This master’s thesis is about optimal route planning for electric vehicles. The first, theoretical part of this work introduces the issue and describes several heuristic methods that have been used to address optimization tasks. A practical part of
Externí odkaz:
http://www.nusl.cz/ntk/nusl-442827
Autor:
Tlapák, Martin
This thesis deals with stochastic location routing problem. Multiple stochas- tic and deterministic models are formulated and it is discussed that it is difficult to solve these problems via exact integer programming methods. It is necessary to devel
Externí odkaz:
http://www.nusl.cz/ntk/nusl-452503
Autor:
Tlapák, Martin
This thesis deals with stochastic location routing problem. Multiple stochas- tic and deterministic models are formulated and it is discussed that it is difficult to solve these problems via exact integer programming methods. It is necessary to devel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::3cfbdce8106ef8131cd69b4806dc671f
http://www.nusl.cz/ntk/nusl-452503
http://www.nusl.cz/ntk/nusl-452503
Publikováno v:
Perner’s Contacts, Vol 4, Iss 3 (2009)
Článek se zaměřuje na vybrané problémy spojené s operativním řízením provozu osobních železničních stanic. Typickým problémem je výskyt zpoždění vlaku na příjezdu, což může mít za následek narušení platného jízdního
Externí odkaz:
https://doaj.org/article/47eebe3814364369bcfcc31be1cadaeb
Autor:
Tlapák, Martin
This bachelor's thesis deals with the theory of the nurse scheduling problem using the theory of integer programming. That is why we define basic concepts and present basic theorem of integer programming. We present the algorithm made for solving int
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::2e0459a57b368c52916b077152b31240
http://www.nusl.cz/ntk/nusl-384238
http://www.nusl.cz/ntk/nusl-384238
Autor:
Piskačová, Nikola
This work deals with the theory of integer programming. In the first part, there are defined the basic concepts and there are mentioned the two most used methods for solving integer problems. Namely, it is the Branch and Bound method and the Cutting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::33938f74915c866df478c957d3a2f320
http://www.nusl.cz/ntk/nusl-384165
http://www.nusl.cz/ntk/nusl-384165
Autor:
Škvarková, Alexandra
It would not be possible to solve real optimization problems, which usually contain a huge number of variables and constraints, without high-performance optimization systems. Today's software market offers a vast number of different systems available
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::e97bcf35c9f104995c7ca7c544527731
http://www.nusl.cz/ntk/nusl-361304
http://www.nusl.cz/ntk/nusl-361304
Autor:
Puček, Samuel
This work deals with the theory of integer programming. After defining the ba- sic concepts, it presents two algorithms suitable for solving integer problems. Firstly, it talks about the branch and bound algorithm and secondly, it talks about the cut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::62056ca6afd1e904d1d809a608fa3872
http://www.nusl.cz/ntk/nusl-365229
http://www.nusl.cz/ntk/nusl-365229