104 citations to 10.1007/s10898-014-0180-4 (Crossref Cited-By Service)
  1. M. Fernanda P. Costa, Ana Maria A. C. Rocha, Edite M. G. P. Fernandes, 12251, Computational Science and Its Applications – ICCSA 2020, 2020, 538  crossref
  2. Dmitri E. Kvasov, Daniela Lera, Yaroslav D. Sergeyev, 2849, INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2021, 2023, 450033  crossref
  3. Remigijus Paulavičius, Lakhdar Chiter, Julius Žilinskas, “Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants”, J Glob Optim, 71, no. 1, 2018, 5  crossref
  4. Victor Gergel, Konstantin Barkalov, Ilya Lebedev, 11353, Learning and Intelligent Optimization, 2019, 78  crossref
  5. Rudolf Scitovski, Kristian Sabo, “Application of the DIRECT algorithm to searching for an optimal k-partition of the set
    $\mathcal {A}\subset \mathbb {R}^n$
    A ⊂
    R
    n
    and its application to the multiple circle detection problem”, J Glob Optim, 74, no. 1, 2019, 63  crossref
  6. Yaroslav D. Sergeyev, Dmitri E. Kvasov, 130, Optimization, Control, and Applications in the Information Age, 2015, 315  crossref
  7. Ya. D. Sergeyev, D. E. Kvasov, M. S. Mukhametzhanov, “On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget”, Sci Rep, 8, no. 1, 2018, 453  crossref
  8. Zhong Jin, David Y. Gao, “On modeling and global solutions for d.c. optimization problems by canonical duality theory”, Applied Mathematics and Computation, 296, 2017, 168  crossref
  9. Stefan C. Endres, Carl Sandrock, Walter W. Focke, “A simplicial homology algorithm for Lipschitz optimisation”, J Glob Optim, 72, no. 2, 2018, 181  crossref
  10. Pu Sun, Hao Liu, Yong Zhang, Qingyao Meng, Liangping Tu, Jian Zhao, “An improved atom search optimization with dynamic opposite learning and heterogeneous comprehensive learning”, Applied Soft Computing, 103, 2021, 107140  crossref
Previous
1
6
7
8
9
10
11
Next