Shor, N.Z. (1962), Application of the gradient method for the solution of network transportation problem (in Russian). In: Notes of Scientific Seminar on Theory and Applications of Cybernetics and Operations Research, Ukrainian Academy of Sciences, Kiev, 9–17.
Shor, N.Z. (1964), On the Structure of Algorithms for Numerical Solution of Problems of Optimal Planning and Design, Diss. Doctor Philos., Kiev (in Russian).
Mikhalevich, V.S., Shor, N.Z. et al. (1967), Computational methods for optimal selection of design decisions. Naukova Dumka, Kiev (in Russian).
Shor, N.Z. (1967), Applications of generalized gradient descent in block programming, Cybernetics, 3(3): 43–45.
Shor, N.Z. (1968), The rate of convergence of the generalized gradient descent menthod, Cybernetics, 4(3): 79–80.
Ermoliev, Yu.M. and Shor, N.Z. (1968), A random search method for two-stage problems of stochastic programming and its generalization, Cybernetics, 1: 90–92.
Shor, N.Z. (1970), Convergence rate of the gradient descent method with space dilation, Cybernetics, 6: 102–108.
Shor, N.Z. and Zhurbenko, N.G. (1971), A minimization method using the operation of space dilation in the direction of the difference of two successive gradients, Cybernetics, 7: 450–459.
Shor, N.Z. (1977), Cut-off method with space dilation in convex programming problems. Cybernetics, 13: 94–96.
Shor, N.Z. (1979), Minimization methods for non-differentiable functions, Naukova Dumka, Kiev (in Russian). English translation published by Springer-Verlag, Berlin, 1985.
Shor, N.Z. and Donets, G.A. (1982), Algebraic approach to the plane graph coloring, Naukova Dumka, Kyiv (in Russian).
Mikhalevich, V.S., Trubin, B.A. and Shor, N.Z. (1986), Optimization Problems of Industrial and Transport Planning, Nauka, Moscow (in Russian).
Shor, N.Z. and Stetsenko, S.I. (1989), Quadratic Extremal Problems and Nondifferential Optimization, Naukova dumka, Kyiv (in Russian).
Shor, N.Z. (1992), Dual estimates in multiextremal problems, Journal of Global Optimization, Vol. 2, 411–418.
Shor, N.Z. and Berezovski, O.A. (1992), New algorithms for constructing optimal circumscribed and inscribed ellipsoids, Optimization Methods and Software, Vol. 1, 283–299.
Shor, N.Z. (1995), Minimization of matrix functions and nondifferentiable optimization. In Review of Applied and Industrial Mathematics, Vol. 2,1: 113–138.
Shor, N.Z. and Voitishin, Yu.V. (1996), Using dual network bounds in algorithms for solving generalized set packing partitioning problems, Computational Optimization and Applications, 6: 293–303.
Shor, N.Z. (1998a), Nondifferentiable Optimization and Polynominial Problems, Kluwer Academic Publishers, Dordrecht.
Shor, N.Z. (1998b), The role of superfluous constraints in improving dual bounds for polynomial optimization problems, Cybernetics and System Analysis, 4: 106–121.
Shor, N.Z., Barbadym, T.A., Zhurbenko, N.G., Stetsyuk, P.I. and Likhovid, A.P. (1999), Using nonsmooth optimization methods in stochastic programming problems, Cybernetics and System Analysis, 5: 33–47.
Shor, N.Z. and Stetsyuk, P.I. (2002), Lagrangian bounds in multiextremal polynomial and discrete optimization problems, Journal of Global Optimization, 23: 1–41.