По результатам конференции GRID'18 в г. Дубна опубликованы тезисы доклада

Vatutin E.I., Titov V.S., Zaikin O.S., Kochemazov S.E., Manzyuk M.O., Nikitina N.N. Orthogonality-based classification of diagonal Latin squares of order 10 // Distributed computing and grid-technologies in science and education (GRID’18): book of abstracts of the 8th international conference. Dubna: JINR, 2018. pp. 94–95.

В них приведено краткое описание найденных в проекте комбинаторных структур из ОДЛК порядка 10. В данном перечне приведено их подробное описание: http://evatutin.narod.ru/evatutin_ls_all_structs_rus.pdf

Поиск новых структур активно продолжается в проекте.

After GRID'18 scientific conference in Dubna was published abstract

Vatutin E.I., Titov V.S., Zaikin O.S., Kochemazov S.E., Manzyuk M.O., Nikitina N.N. Orthogonality-based classification of diagonal Latin squares of order 10 // Distributed computing and grid-technologies in science and education (GRID’18): book of abstracts of the 8th international conference. Dubna: JINR, 2018. pp. 94–95.

This publication contains brief description of the combinatorial structures from ODLSs of order 10. This list contains their detailed description: http://evatutin.narod.ru/evatutin_ls_all_structs_eng.pdf

The search for new structures is actively continuing in the project.

We have two new articles that are recently published in Open Engineering journal.

Vatutin E.I. Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem // Open Engineering. Vol. 7. Iss. 1. 2017. pp. 428–434. DOI: 10.1515/eng-2017-0041. https://www.degruyter.com/view/j/eng.2017.7.issue-1/eng-2017-0041/eng-2017-0041.xml?format=INT

Vatutin E.I., Zaikin O.S., Kochemazov S.E., Valyaev S.Y. Using Volunteer Computing to Study Some Features of Diagonal Latin Squares // Open Engineering. Vol. 7. Iss. 1. 2017. pp. 453–460. DOI: 10.1515/eng-2017-0052. https://www.degruyter.com/view/j/eng.2017.7.issue-1/eng-2017-0052/eng-2017-0052.xml?format=INT

They are includes some results of computing experiments aimed to investigate quality of heuristic decisions in the graph shortest path problem (first) and to find diagonal Latin squares with extremal number of transversals (second).