Shevchenko Valerii Nikolaevich

Publications in Math-Net.Ru

1. On the two properties of the Frobenius number
   
   Meždunar. nauč.-issled. žurn., 2022, no. 9(123),  1–5
2. On the maximal minors of multi-index transport problems
   
   Tr. Inst. Mat., 23:2 (2015),  97–102
3. On the minors of the matrix of constraints of multi-index transportation problems
   
   Diskr. Mat., 24:4 (2012),  147–157
4. On the minor characteristics of orthogonal integer lattices
   
   Diskretn. Anal. Issled. Oper., 15:4 (2008),  25–29
5. About $f$-vectors of pyramidal triangulations of point configurations
   
   Diskretn. Anal. Issled. Oper., 15:3 (2008),  74–90
6. On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a restriction on the cardinality
   
   Diskretn. Anal. Issled. Oper., Ser. 2, 13:2 (2006),  56–73
7. A modification of the Fourier–Motskin algorithm for constructing a triangulation and its star coloring
   
   Diskretn. Anal. Issled. Oper., Ser. 2, 13:1 (2006),  77–94
8. On the similarity of second-order matrices over the ring of integers
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 4,  57–64
9. On a multicriterial problem of integer linear programming
   
   Diskretn. Anal. Issled. Oper., Ser. 2, 12:2 (2005),  72–84
10. The square of the minor of the constraint matrix of the axial transport problem: its mean
    
    Avtomat. i Telemekh., 2004, no. 2,  113–117
11. A modification of the Fourier-Motskin algorithm for constructing a triangulation
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 10:1 (2003),  53–64
12. Characteristic polynomials of multi-index transportation problems
    
    Diskr. Mat., 15:2 (2003),  83–88
13. Estimating the complexity of deciphering a threshold functions in a $k$-valued logic
    
    Zh. Vychisl. Mat. Mat. Fiz., 39:2 (1999),  346–352
14. Asymptotics of the permanents of some $(0,1)$-matrices
    
    Diskr. Mat., 10:1 (1998),  82–86
15. Polynomial algorithms for computing the permanents of some matrices
    
    Diskr. Mat., 9:3 (1997),  96–100
16. On a partition of a convex polytope into simplexes without new vertices
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1997, no. 12,  89–99
17. Deciphering of threshold functions of $k$-valued logic
    
    Diskretn. Anal. Issled. Oper., 2:3 (1995),  18–23
18. Minors and permanents of some (0,1)-matrices
    
    Diskr. Mat., 3:2 (1991),  96–102
19. Martin's algorithm and correct cutting planes for integer linear programming
    
    Zh. Vychisl. Mat. Mat. Fiz., 20:2 (1980),  505–509
20. On one method то solve a variable coefficient linear programming problem
    
    Avtomat. i Telemekh., 1979, no. 5,  114–120
21. A solution algorithm for the coordination problem in a two-level system of models
    
    Avtomat. i Telemekh., 1979, no. 4,  166–169
22. The solution of the elementary integer linear programming problem
    
    Upravliaemie systemy, 1975, no. 14,  69–73
23. The dual description of a cone integer-valuedly-generated by a finite set of vectors
    
    Mat. Zametki, 14:4 (1973),  523–526