On a Problem of Search by Networks
I. P. Tsaregradskii · Theory of Probability and Its Applications · 1970
Previous article Next article On a Problem of Search by NetworksI. P. TsaregradskiiI. P. Tsaregradskiihttps://doi.org/10.1137/1115037PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] A. M. Shurygin, Computation of optimal drill-hole networks for searches of elliptic layers of definite size, Razvedka i Okhrana Nedr., 12 (1966), 16–20, (In Russian.) Google Scholar[2] N. Bourbaki, Éléments de mathématique. IX. Première partie: Les structures fondamentales de l'analyse. Livre IV: Fonctions d'une variable réelle (théorie élémentaire). Chapitre I: Dérivées. Chapitre II: Primitives et intégrales. Chapitre III: Fonctions élémentaires, Actualités Sci. Ind., no. 1074, Hermann et Cie., Paris, 1949ii+184 MR0031013 0036.16801 Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails What has seismic missed?Nonrenewable Resources, Vol. 3, No. 4 Cross Ref Volume 15, Issue 2| 1970Theory of Probability & Its Applications History Submitted:30 November 1968Published online:17 July 2006 InformationCopyright © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1115037Article page range:pp. 315-319ISSN (print):0040-585XISSN (online):1095-7219Publisher:Society for Industrial and Applied Mathematics