Výsledky vyhledávání - "D. S. Malyshev"

Akademický článek

The methodology for increasing the organizational efficiency of the enterprise

Autor: R. A. Dolzhenko, S. B. Dolzhenko, D. S. Malyshev

Publikováno v: Модернизация, инновация, развитие, Vol 14, Iss 1, Pp 76-93 (2023)

Purpose: of the study is to present and study the results of the implementation of the methodology for improving organizational efficiency, which was tested at an industrial enterprise in the Sverdlovsk region.Methods: traditional general scientific

Externí odkaz: https://doaj.org/article/7f525285f8f442b8b0c2f7f1d5946421

Zobrazit plný text záznamu

On a Countable Family of Boundary Graph Classes for the Dominating Set Problem

Autor: G. S. Dakhno, D. S. Malyshev

Publikováno v: Journal of Applied and Industrial Mathematics. 17:25-31

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9c4434a14608515ac3883d41adec9adf
https://doi.org/10.1134/s1990478923010039

Zobrazit plný text záznamu

Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems

Autor: D. V. Gribanov, I. A. Shumilov, D. S. Malyshev

Publikováno v: Optimization Letters.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::dd75ccd68d5138abf627cd58009deb61
https://doi.org/10.1007/s11590-023-02017-5

Zobrazit plný text záznamu

Problems on the way of digital transformation at Russian industrial enterprises

Autor: R. A. Dolzhenko, D. S. Malyshev

Publikováno v: Vestnik NSUEM. :31-51

The economy of our country and the enterprises that make up its basis are characterized by low indicators of labor productivity. One of the ways to eliminate this problem is the widespread digitalization of processes, which allows for total fixation

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::590dc7faa7fa858884d81eb93ab4ff78
https://doi.org/10.34020/2073-6495-2022-1-031-051

Zobrazit plný text záznamu

Enumeration of Matchings in Complete $$q$$-ary Trees

Autor: N. A. Kuz’min, D. S. Malyshev

Publikováno v: Mathematical Notes. 111:398-406

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::633b1b795a4f05f303234be09cdce79c
https://doi.org/10.1134/s0001434622030075

Zobrazit plný text záznamu

An intractability result for the vertex 3-colourability problem

Autor: D. S. Malyshev, O. V. Pristavchenko

Publikováno v: Optimization Letters. 16:1403-1409

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::fa6517552194323ca279055a2c69d275
https://doi.org/10.1007/s11590-022-01859-9

Zobrazit plný text záznamu

A New Proof of a Result Concerning a Complete Description of $$ (n, n + 2) $$-Graphs with Maximum Value of the Hosoya Index

Autor: N. A. Kuz’min, D. S. Malyshev

Publikováno v: Mathematical Notes. 111:258-272

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::1aad53194c8df0fa87bc72fda26d4366
https://doi.org/10.1134/s0001434622010291

Zobrazit plný text záznamu

On 3-Colouring Of Graphs with Short Faces and Bounded Maximum Vertex Degree

Autor: D. V. Sirotkin, D. S. Malyshev

Publikováno v: Lobachevskii Journal of Mathematics. 42:760-766

The vertex 3-colourability problem is to verify whether it is possible to split the vertex set of a given graph into three subsets of pairwise nonadjacent vertices or not. This problem is known to be NP-complete for planar graphs of the maximum face

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::6cb841db5ab1b23fd268ec530e71395a
https://doi.org/10.1134/s1995080221040181

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání