Fazylov Valeriy Raufovich

Publications in Math-Net.Ru

1. Formation of the guillotine cutting card of a sheet by the guillotine layout functions
   
   Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 159:2 (2017),  161–173
2. Models of the Nonguillotine Sheet and Strip Rectangular Packing Problem
   
   Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 155:2 (2013),  5–17
3. Two Schemes of the Branch and Bound Method for a Flow Shop Total Weighted Tardiness Minimization Problem
   
   Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 154:3 (2012),  180–189
4. About the generator of the data for the single machine total weighted tardiness problem
   
   Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 152:1 (2010),  199–204
5. Little's Method with Penalties for the Decision of Capacitated Vehicle Routing Problem
   
   Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 150:4 (2008),  88–97
6. Little's method with optimal reduction of a matrix
   
   Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 148:4 (2006),  13–22
7. On the optimal reduction of the costs matrix
   
   Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 148:2 (2006),  18–22
8. The method of convex programming with a prescribed absolute-relative error
   
   Zh. Vychisl. Mat. Mat. Fiz., 38:8 (1998),  1247–1254
9. A general convex programming method with given accuracy
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 12,  63–73
10. Finding a minimax with specified accuracy
    
    Zh. Vychisl. Mat. Mat. Fiz., 34:5 (1994),  793–799
11. On control of penetration in the support-vector algorithm with compound step
    
    Issled. Prikl. Mat., 18 (1992),  79–87
12. On the application of the flexible polyhedron method to solve mathematical programming problems
    
    Issled. Prikl. Mat., 18 (1992),  26–30
13. A sliding backup scheme for organizing robust control systems
    
    Issled. Prikl. Mat., 18 (1992),  16–26
14. Convex optimization with prescribed accuracy
    
    Zh. Vychisl. Mat. Mat. Fiz., 30:5 (1990),  663–671
15. Random search method for solving series of linear programming problems
    
    Issled. Prikl. Mat., 16 (1989),  120–124
16. A finite method for solving systems of convex inequalities
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1984, no. 11,  59–63
17. Scheduling a group of identical machine tools
    
    Issled. Prikl. Mat., 11:1 (1984),  62–65
18. A simple batch size problem
    
    Issled. Prikl. Mat., 11:1 (1984),  53–62
19. A general method of finding a point in a convex set
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1983, no. 6,  43–51
20. Method of successive projection with $\varepsilon$-descent
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1981, no. 10,  47–48
21. Projection with $\varepsilon$-depth and its application to the solution of homogeneous systems of linear inequalities
    
    Issled. Prikl. Mat., 8 (1980),  18–22
22. Supporting cone of a polyhedron
    
    Issled. Prikl. Mat., 8 (1980),  15–17
23. Construction of the cone of support functionals for a polyhedral set
    
    Issled. Prikl. Mat., 7 (1979),  51–54