\documentclass[10pt]{article}
\usepackage[utf8]{inputenc}		%[utf8][cp1251][cp866]
\usepackage[T2A]{fontenc}		%[T1][TS1][OT1][OT2][T2A][T2B][T2C][X2]
\usepackage[russian,english]{babel}
\usepackage{amssymb,amsmath,amsfonts,amsthm}
\usepackage{verbatim}
\usepackage{cite}
% \usepackage{cmap}
\usepackage{srcltx}
% \usepackage{hyperref}
% \usepackage{remreset}
\usepackage{graphicx}
% \usepackage[left=1cm,right=1cm,top=1cm,bottom=1cm]{geometry} % поля страницы

% \renewcommand{\baselinestretch}{1.2}
% \renewcommand{\thesection}{\arabic{chapter}.\arabic{section}.}

%A4 ~ 595pt x 840pt (210mm x 297mm)
%1pt = 0.3528mm
\oddsidemargin 24pt
\textwidth 444pt

\topmargin 12pt
\headheight 0pt
\headsep 0pt
\textheight 650pt
% \setlength{\textheight}{45\baselineskip}
% \setlength{\textheight}{\baselinestretch\textheight}
% \addtolength{\textheight}{\topskip}

\binoppenalty=10000
\relpenalty=10000

\date{}

\begin{document}

 

\begin{thebibliography}{99}  %% {99} если цитируется больше 9 источников



\bibitem{*}
\textbf{ N.\,N.\,Krasovskii  } and \textbf{ A.\,I.\,Subbotin,} \textit{Positsionnye differentsial'nye igry} [Positional Differential Games]  Nauka, Moscow, 1974.

\bibitem{ushakov2010_3}
   \textbf{  V.\,N.\,Ushakov, A.\,A.\,Uspenskii} and \textbf{ A.\,G.\,Malev ,}
 An estimate of the stability defect for a positional absorption set subjected to discriminant transformations. \textit{Proceedings of the Steklov Institute of Mathematics,}  \textbf{279},  113--129,  2012.

 \bibitem{KazAT2}       \textbf{   A.\,L.\,Kazakov, A.\,A.\,Lempert } and \textbf{D.\,S.\,Bukharov,}
 On segmenting logistical zones for servicing continuously developed consumers \textit{Automation and Remote Control,}   \textbf{754}, No.~6,   968--977, 2013.


\bibitem{2017}
\textbf{V.\,N.\,Ushakov , P.\,D.\,Lebedev } and \textbf{  N.\,G.\,Lavrov,}  Algorithms of optimal packing construction in ellipse, \textit{Vestnik
YuUrGU. Ser. Mat. Model. Progr.,}  \textbf{10} , issue 3.   67--79, 2017. DOI: 10.14529/mmp170306
 


\bibitem{2018} %
\textbf{P.\,D.\,Lebedev } and \textbf{   A.\,L.\,Kazakov, } Iterative methods for the construction of planar packings of circles of different
size, \textit{  Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk,} \textbf{24}, No. 2,   141--151, 2018.
DOI: 10.21538/0134-4889-2018-24-2-141-151


\bibitem{Lebedev-Machchhar}
\textbf{ J.\,Machchhar } and \textbf{  G.\,Elber, } Dense packing of congruent circles in free-form non-convex containers \textit{Computer Aided Geometric Design,} \textbf{ 52--53},   2017.   13--27. DOI:~10.1016/j.cagd.2017.03.006

\bibitem{Meng}
\textbf{L.\,Meng, X.\,Yao, } and \textbf{
Ch\,Wang }  Non-convex shape effects on the dense random packing properties of assembled rods \textit{
 Physica A: Statistical Mechanics and its Applications,}  \textbf{  490}. 2017.
doi: 10.1016/j.physa.2017.08.026

\bibitem{Subbotin}
\textbf{Subbotin A.I.}  \textit{Generalized solutions of first-order PDEs.} The dynamical optimization perspective, Boston:
BirkhЁauser, 1995, xi+314 p. DOI: 10.1007/978-1-4612-0847-1

\bibitem{Demyanov}
\textbf{V.\,F.\,Dem’yanov } and \textbf{L.\,V.\,Vasil’ev ,}\textit{ Nedifferentsiruemaya optimizatsiya} [Non-differentiable optimization],
Moscow: Nauka, 1981, 384 p.


\bibitem{Rokaf} 
\textbf{R.\,Rockafellar.  }\textit{  Convex Analysis.}  Princeton Univ., Princeton, 1970.


 \bibitem{lebedev2012}
\textbf{ P.\,D.\,Lebedev  } and \textbf{A.\,V.\,Ushakov,  } Approximating sets on a plane with optimal sets of circles  \textit{Automation and Remote Control,}
 \textbf{  73}, Issue 3,   485--493, 2012.  doi: 10.1134/S0005117912030071


\bibitem{fedorov}
\textbf{ A.\,G.\,Sukharev, A.\,V.\,Timokhov } and \textbf{V.\,V.\,Fedorov,} \textit{ Kurs metodov optimizatsii} [A course in optimization
methods], Moscow: Nauka, 1986. 326 p.

 \bibitem{Nurminsky}
\textbf{E.\,A.\,Nurminskii } and \textbf{  D.\,Tien, }   Method of conjugate subgradients with constrained memory \textit{Autom. Remote Control,} \textbf{  75}, No 4, 646--656,  2014, doi 10.1134/S0005117914040055

\bibitem{vorontsova}
\textbf{  E.\,A\,Vorontsova,} Linear tolerance problem for the interval model of interindustry balance \textit{Vychislitel'nyye tekhnologii } (Computing technology)  \textbf{ 22},  No 2.    67--84, 2017. 

\bibitem{nesterov}
\textbf{ A.\,V.\,Gasnikov,  P.\,E.\,Dvurechensky, D.\,I.\,Kamzolov,  Y.\,E.\,Nesterov, V.\,G.\,Spokoiny, P.\,I.\,Stetsyuk,  A.\,L.\,Suvorikova} and \textbf{ A.\,V.\,Chernov, }   Search for equilibriums  in multi-stage transport models \textit{Trudy MFTI,} [Proceedings of MIPT]  \textbf{  7}, No 4,  143--155. 2015.
 

\bibitem{programm}
\textbf{P.\,D.\,Lebedev,}  \textit{The program for calculating the optimal coverage of a hemisphere by a set of spherical
segments,} The certificate of state registration, no. 2015661543, 29.10.2015.

 \bibitem{tot}
\textbf{L.\,F.\,T\'{o}th,}  \textit{Lagerungen in der Ebene, auf der Kugel und im Raum,} Berlin: Springer, 1953, x+198 p.  [German].
DOI: 10.1007/978-3-662-01206-2

\bibitem{Mestecky} \textbf{L.\,M.\,Mestetskiy,}\textit{  Nepreryvnaya morfologiya binarnykh izobrazheniy. Figury, skelety, tsyrkulyary} 
[Continuous morphology of binary images. Figures, skeletons, circular]. Fismatlit, Moscow, 2009.

\bibitem{2019} \textbf{   P.\,D.\,Lebedev} and  \textbf{ A.\,A.\,Uspenskii,} Construction of a nonsmooth solution in a time-optimal problem with a low order of smoothness of the boundary of the target set, \textit{ Trudy Instituta Matematiki i Mekhaniki UrO RAN,}  [Proceedings of the Institute of Mathematics and Mechanics].  \textbf{ 25}, No. 1,  108--119. 2019,

\bibitem{Savelov} \textbf{A.\,A.\,Savelov,  } \textit{ Ploskiye krivyye. Sistematika, svoystva, primeneniya.} [Flat curves. Systematics, properties, applications.] Librocom, Moscow. 2010.

\bibitem{Sp}
\textbf{E.\,Specht, }
  \textit{  Packomania.}
www.packomania.com  
%
%\bibitem{Alekseev1999}
%\textbf{V.\,E.\,Alekseev,}
%A polynomial algorithm for finding the largest independent sets in claw-free graphs,
%\textit{Diskretn. Anal. Issled. Oper., Ser.~1,} \textbf{6}, No.~4, 3--19, 1999.
%
%\bibitem{GK2014}
%\textbf{A.\,E.\,Galashov} and \textbf{A.\,V.\,Kel'manov,}
%A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets,
%\textit{Avtom. Telemekh.,} No.~4, 5--19, 2014.
%Translated in \textit{Autom. Remote Control,} \textbf{75}, No.~4, 595--606, 2014.
%
%\bibitem{Marchenkov2011}
%\textbf{S.\,S.\,Marchenkov,} FE classification of functions of many-valued logic,
%\textit{Vestn. Mosk. Univ., Ser. 15,} No.~2, 32--39, 2011.
%Translated in \textit{Mosc. Univ. Comput. Math. Cybern.,} \textbf{35}, No.~2, 89--96, 2011.
%
%\bibitem{DK2015}
%\textbf{I.\,A.\,Davydov} and \textbf{Yu.\,A.\,Kochetov,}
%VNS-based heuristic with an exponential neighborhood for the server load balancing problem,
%\textit{Electron. Notes Discrete Math.,} \textbf{47}, 53--60, 2015.
%
%\bibitem{FJ2010}
%\textbf{G.\,Fan} and \textbf{S.\,Jin,} Coverage problem in wireless sensor network: A survey,
%\textit{J. Netw.,} \textbf{5}, No.~9, 1033--1040, 2010.
%
%\bibitem{EG1960}
%\textbf{P.\,Erd\H{o}s} and \textbf{T.\,Gallai,} Graphs with prescribed degrees of vertices,
%\textit{Mat. Lapok.,} \textbf{11}, 264--274, 1960 [Hungarian].
%
%\bibitem{Havel1955}
%\textbf{V.\,Havel,} A remark on the existence of finite graphs,
%\textit{\v{C}as. P\v{e}stov\'{a}n\'{\i} Mat.,} \textbf{80}, No.~4, 477--480, 1955 [Czech].
%
%\bibitem{Konig1916}
%\textbf{D.\,K\"{o}nig,} On graphs and its applications to determinant theory and set theory,
%\textit{Math. Ann.,} \textbf{77}, No.~4, 453--465, 1916 [German].
%
%\bibitem{Vasilev1978}
%\textbf{Yu.\,L.\,Vasil’ev,} Massive classes of dense Boolean functions,
%in \textit{Metody diskretnogo analiza v sinteze upravlyayushchikh sistem}
%(Methods of Discrete Analysis in Synthesis of Control Systems), Vol.~32, pp.~21--33,
%Izd. Inst. Mat., Novosibirsk, 1978.
%
%\bibitem{Yablonskii1982}
%\textbf{S.\,V.\,Yablonskii,} Asymptotically best method for synthesis of reliable circuits from unreliable elements,
%in J.\,L.\,Kulikowski, M.\,Michalewicz, S.\,V.\,Yablonskii, and Yu.\,I.\,Zhuravlev, eds., \textit{Discrete Mathematics,}
%pp.~11--19, Instytut Matematyczny PAN, Warsaw, 1982 (Banach Cent. Publ., Vol.~7).
%
%\bibitem{KS2014}
%\textbf{E.\,A.\,Kazakovtseva} and \textbf{V.\,V.\,Servakh,}
%NP-hardness of the project scheduling problem with credits
%in \textit{Tezisy dokladov XVI Baikal'skoi mezhdunarodnoi shkoly-seminara ``Metody optimizatsii i ikh prilozheniya''}
%(Abstr. XVI Baikal Int. School-Seminar ``Optimization Methods and Their Applications''),
%\textit{Olkhon, Irkutsk Reg., Russia, June 30 -- July 6, 2014,} p.~56, Inst. Sist. Energ. SO RAN, Irkutsk, 2014.
%
%\bibitem{Zakharova2010}
%\textbf{D.\,V.\,Zakharova,}
%Weighted independent sets in graphs with bounded minors of the extended incidence matrix,
%in \textit{Materialy X Mezhdunarodnogo seminara ``Diskretnaya matematika i ee prilozheniya''}
%(Proc. X Int. Seminar ``Discrete Math. and Its Applications''),
%\textit{Moscow, Russia, Jan.~1--6, 2010,} pp.~303--305, Izd. Mekh.-Mat. Fak. MGU, Moscow, 2010.
%
%\bibitem{Malyugin2001}
%\textbf{S.\,A.\,Malyugin,} On affine nonsystematic codes, in \textit{Proc. Conf. Devoted
%to the 90th Anniversary of A.\,A.\,Lyapunov, Novosibirsk, Russia, Oct.~8--11, 2001,} pp.~393--394,
%Novosibirsk, 2009. Available at http://www.sbras.ru/ws/Lyap2001/2288/. Accessed Jan. 13, 2015.
%
%\bibitem{Uhlig1987}
%\textbf{D.\,Uhlig,} Reliable networks from unreliable gates with almost minimal complexity,
%in \textit{Fundamentals of Computation Theory} (Proc. Int. Conf. FCT’87, Kazan, USSR, June 22--26, 1987),
%pp.~462--469, Springer-Verlag, Berlin, 1987 (Lect. Notes Comput. Sci., Vol.~278).
%
%\bibitem{Alekseev2004}
%\textbf{V.\,B.\,Alekseev,} \textit{Lektsii po diskretnoi matematike} (Lectures on Discrete Mathematics),
%Izd. Otd. Fak. VMiK MGU, Moscow, 2004.
%
%\bibitem{EMST1990}
%\textbf{V.\,A.\,Emelichev, O.\,I.\,Melnikov, V.\,I.\,Sarvanov,} and \textbf{R.\,I.\,Tyshkevich,}
%\textit{Lektsii po teorii grafov,} Nauka, Moscow, 1990. Translated under the title
%\textit{Lectures on Graph Theory,} B.\,I.\,Wissen\-schaftsverlag, Mannheim, 1994.
%
%\bibitem{Stetsyuk2014}
%\textbf{P.\,I.\,Stetsyuk,}
%\textit{Metody ellipsoidov i $r$-algoritmy} (Ellipsoid Methods and $r$-Algorithms), Evrika, Chisinau, 2014.
%
%\bibitem{GJ1979}
%\textbf{M.\,R.\,Garey} and \textbf{D.\,S.\,Johnson,}
%\textit{Computers and Intractability: A Guide to the Theory of NP-Completeness,} Freeman, San Francisco, 1979.
%Translated under the title \textit{Vychislitel'nye mashiny i trudnoreshaemye zadachi,} Mir, Moscow, 1982.
%
%\bibitem{Attallah1998}
%\textbf{M.\,J.\,Attallah,} ed.,
%\textit{Algorithms and Theory of Computation Handbook,} CRC Press, Boca Raton, 1998.
%
%\bibitem{Chugunova2007}
%\textbf{V.\,V.\,Chugunova,} Synthesis of asymptotically optimal reliable circuits under inverse failures
%at the element outputs, \textit{Cand. Sci. Dissertation,} Penz. Gos. Univ., Penza, 2007.
%
%\bibitem{Hansen1992}
%\textbf{H.\,M.\,Hansen,} Scheduling with minimum waiting periods, \textit{Master Thesis,}
%Odense Univ., Odense, Denmark, 1992.

\end{thebibliography}

\end{document}
