| Full list of publications: |
|
|
Citations (Crossref Cited-By Service + Math-Net.Ru) |
|
|
|
 2023 |
| 1. |
Ruslan Yu. Simanchev, Inna V. Urazova, Vladimir V. Voroshilov, “The minimal dominating sets in a directed graph and the key indicators set of socio-economic system”, Ural Math. J., 9:1 (2023), 153–161   ; |
| 2. |
R. Yu. Simanchev, I. V. Urazova, “Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests”, Proc. Steklov Inst. Math. (Suppl.), 323, suppl. 1 (2023), S243–S254    |
|
| 2021 |
| 3. |
R. Yu. Simanchev, P. V. Solovieva, I. V. Urazova, “The affine hull of the schedule polytope for servicing identical requests by parallel devices”, J. Appl. Industr. Math., 15:1 (2021), 146–157 |
|
| 2019 |
| 4. |
R. Yu. Simanchev, I. V. Urazova, Yu. A. Kochetov, “The branch and cut method for the clique partitioning problem”, J. Appl. Industr. Math., 13:3 (2019), 539–556  |
|
| 2018 |
| 5. |
R. Yu. Simanchev, “On the vertex adjacency in a polytope of connected k-factors”, Trudy Inst. Mat. i Mekh. UrO RAN, 24, no. 2, 2018, 235–242  |
|
| 2017 |
| 6. |
R. Yu. Simanchev, “On facet-inducing inequalities for combinatorial polytopes”, J. Appl. Industr. Math., 11:4 (2017), 564–571 |
|
| 2015 |
| 7. |
R. Yu. Simanchev, I. V. Urazova, “On the faces of the graph approximation problem polytope”, J. Appl. Industr. Math., 9:2 (2015), 283–291 |
|
| 2014 |
| 8. |
R. Yu. Simanchev, N. Yu. Shereshik, “Integer models for the interrupt-oriented services of jobs by single machine”, Diskretn. Anal. Issled. Oper., 21:4 (2014), 89–101 |
| 9. |
R. Yu. Simanchev, “Combinatorial structure and adjacency of vertices of polytope of $b$-factors”, Russian Math. (Iz. VUZ), 58:6 (2014), 51–62 |
|
| 2011 |
| 10. |
R. Yu. Simanchev, I. V. Urazova, “Scheduling unit-time jobs on parallel processors polytope”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 85–97 |
|
| 2010 |
| 11. |
R. Yu. Simanchev, I. V. Urazova, “An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences”, Autom. Remote Control, 71:10 (2010), 2102–2108 |
|
| 1996 |
| 12. |
R. Yu. Simanchev, “Rank inequalities that generate facets of a polyhedron of connected $k$-factors”, Diskretn. Anal. Issled. Oper., 3:3 (1996), 84–110 |
|
| 1990 |
| 13. |
R. Yu. Simanchev, “Completely regular cuttings for problems of integer optimization”, Upravliaemie systemy, 1990, no. 30, 61–71 |
|
Contact us: