[1]

K. H. Rosen. Handbook of discrete and combinatorial mathematics. Chapman and Hall/CRC, 2000. Google Scholar

[2]

E. I. Vatutin, V. S. Titov, and S. G. Emelyanov. Basics of discrete combinatorial optimization (in Russian). Argamac-Media, 2016. Google Scholar

[3]

A. P. Karpenko. Modern algorithms of search optimization. Algorithms inspired by nature (in Russian). Bauman Moscow State Technical University, 2014. Google Scholar

[4]

R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36(6):1389–1401, 1957. CrossrefGoogle Scholar

[5]

J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48–50, 1956. CrossrefGoogle Scholar

[6]

H. W. Kuhn. Variants of the hungarian method for assignment problems. Naval Research Logistics Quarterly, 3:253–258, 1956. CrossrefGoogle Scholar

[7]

J. Munkres. Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics, 5(1):32–38, 1957. CrossrefGoogle Scholar

[8]

A. H. Land and A. G. Doig. An automatic method of solving discrete programming problems. Econometrica, 28:497–520, 1960. CrossrefGoogle Scholar

[9]

C. J. Colbourn and J. H. Dinitz. Handbook of combinatorial designs, second edition (Discrete mathematics and its applications). Chapman & Hall/CRC, 2006. Google Scholar

[10]

O. S. Zaikin, S. E. Kochemazov, and A. A. Semenov. SAT-based search for systems of diagonal Latin squares in volunteer computing project SAT@home. In 39th International Convention on Information and Communication Technology, Electronics and Microelectronics, MIPRO 2016, Opatija, Croatia, May 30 – June 3, 2016, pages 277–281, 2016. Google Scholar

[11]

E. I. Vatutin, E. N. Dremov, I. A. Martynov, and V. S. Titov. Weighted random search method for discrete combinatorial problems solving (in russian). Proceedings of Volgograd State Technical University. Series: Electronics, Measuring Equipment, Radiotechnics and Communication, 10(137):59–64, 2014. Google Scholar

[12]

M. Dorigo and T. Stützle. Ant colony optimization. MIT Press, 2004. Google Scholar

[13]

E. I. Vatutin and V. S. Titov. Analysis of results of ant colony optimization method in the problem of getting shortest path in graph with constraints (in russian). Proceedings of South State University. Technical sciences, 12(161):111–120, 2014. Google Scholar

[14]

F. W. Glover and G. A. Kochenberger. Handbook of Metaheuristics. Springer US, 2003. Google Scholar

[15]

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671–680, 1983. CrossrefGoogle Scholar

[16]

D. Karaboga. An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Erciyes University, October 2005. Google Scholar

[17]

D. T. Pham, A. Ghanbarzadeh, E. Koc, S. Otri, S. Rahim, and M. Zaidi. The bees algorithm, a novel tool for complex optimisation problems. In Proceedings of the 2nd International Virtual Conference on Intelligent Production Machines and Systems (IPROMS 2006), pages 454–459. Elsevier, 2006. Google Scholar

[18]

J. Kennedy and R. Eberhart. Particle Swarm Optimization. In Proceedings of IEEE International Conference on Neural Networks, volume 4, pages 1942–1948, Washington, DC, USA, November 1995. IEEE Computer Society. Google Scholar

[19]

E. W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math., 1(1):269–271, December 1959. CrossrefGoogle Scholar

[20]

E. I. Vatutin, S. Yu. Valyaev, and V. S. Titov. Comparison of sequential methods for getting separations of parallel logic control algorithms using volunteer computing. In Second International Conference BOINC-based High Performance Computing: Fundamental Research and Development (BOINC:FAST 2015), Petrozavodsk, Russia, September 14-18, 2015, volume 1502 of CEUR-WS, pages 37–51, 2015. Google Scholar

[21]

E. I. Vatutin and V. S. Titov. Superiority areas analysis of sequential heuristic methods for getting separations during logical multicontrollers design. Journal of Instrument Engineering, 58(2):115–122, 2015. Google Scholar

[22]

D. P. Anderson. Boinc: A system for public-resource computing and storage. In Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing, GRID ’04, pages 4–10, Washington, DC, USA, 2004. IEEE Computer Society. Google Scholar

[23]

E. I. Vatutin, I. A. Martynov, and V. S. Titov. Analysis of results of depth first search with fixed depth method at the shortest path problem (in russian). In Multicore processors, parallel programming, FPGA, signal processing systems, pages 120–128. Altay State University, 2015. Google Scholar

[24]

C. Y. Lee. An algorithm for path connections and its applications. IRE Trans. Electronic Computers, 10(3):346–365, 1961. Google Scholar

[25]

R. W. Hamming. Error detecting and error correcting codes. Bell System Technical Journal, 26(2):147–160, 1950. Google Scholar

[26]

I. I. Kurochkin. Determination of replication parameters in the project of the voluntary distributed computing netmax@home. Science. Business. Society, 2:10–12, 2016. Google Scholar

[27]

N. N. Nikitina and E. E. Ivashko. The price of anarchy in a game for drug discovery. In Networking Games and Management Extended abstracts, pages 24–25, 2016. Google Scholar

[28]

E. I. Vatutin. Comparison of decisions quality of heuristic methods with sequential formation of the decision in the graph shortest path problem. In Third International Conference BOINC-based High Performance Computing: Fundamental Research and Development (BOINC:FAST 2017), Petrozavodsk, Russia, August 28 – September 1, 2017, CEUR-WS. Google Scholar

[29]

E. I. Vatutin, I. A. Martynov, and V. S. Titov. Method of workaround deadlocks for solving discrete combinatorial optimization problems with constraints (in russian). In Perspective information technologies, pages 313–317, 2014. Google Scholar

## Comments (0)

General note:By using the comment function on degruyter.com you agree to our Privacy Statement. A respectful treatment of one another is important to us. Therefore we would like to draw your attention to our House Rules.