Zobrazeno 1 - 4
of 4
pro vyhledávání: '"M. S. Barketau"'
Publikováno v:
Informatika, Vol 15, Iss 1, Pp 21-33 (2018)
Modeling of movement of objects without stops in a network of crossing routes is studied. The problem is formulated in terms of disjunctive linear programming, mixed integer linear programming and graph theory. Several variants for representing const
Externí odkaz:
https://doaj.org/article/2d470d7b5e1f4af38cebfc89975e9f3b
Publikováno v:
Informatika, Vol 0, Iss 2, Pp 22-29 (2016)
In this paper we consider the container transshipment problem at a railway hub. New lowerbounds are developed. One lower bound is based on the linear relaxation of the integer linear formulation, and the other lower bound is based on the Lagrangian r
Externí odkaz:
https://doaj.org/article/2756fc4161954005b0ac85121f839361
Publikováno v:
Informatika, Vol 0, Iss 3, Pp 67-69 (2016)
We develop two methods of solving DBM system. One method is based on Fourier – Motskinelimination scheme, it has complexity O(n3) for finding initial solve and complexity O(n3) for finding solve by changing one of variable value for some cases. The
Externí odkaz:
https://doaj.org/article/46fecac7cf2e4d65b89fdb87284c6231
Autor:
M. S. Barketau
Publikováno v:
Doklady of the National Academy of Sciences of Belarus. 66:489-494
The asymmetric travelling salesman problem without metric restrictions is considered. The randomized algorithm is proposed. It has a certain approximation guarantee and possesses a certain property regarding the probabilities of the tours built. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ef85d571aa6dd3c1082d2bb529c8eed
https://doi.org/10.29235/1561-8323-2022-66-5-489-494
https://doi.org/10.29235/1561-8323-2022-66-5-489-494