|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1999, Volume 39, Number 3, Pages 386–417
(Mi zvmmf1714)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Approximate search for a global minimum in problems of mathematical programming that are close to convex
V. V. Voloshinov, E. S. Levitin Institute of Systems Analysis, Russian Academy of Sciences
Received: 08.06.1998
Citation:
V. V. Voloshinov, E. S. Levitin, “Approximate search for a global minimum in problems of mathematical programming that are close to convex”, Zh. Vychisl. Mat. Mat. Fiz., 39:3 (1999), 386–417; Comput. Math. Math. Phys., 39:3 (1999), 365–396
Linking options:
https://www.mathnet.ru/eng/zvmmf1714 https://www.mathnet.ru/eng/zvmmf/v39/i3/p386
|
Statistics & downloads: |
Abstract page: | 218 | Full-text PDF : | 141 | References: | 71 | First page: | 1 |
|