52 citations to 10.1016/0167-8191(92)90069-J (Crossref Cited-By Service)
  1. Neng Fan, Panos M. Pardalos, “Linear and quadratic programming approaches for the general graph partitioning problem”, J Glob Optim, 48, no. 1, 2010, 57  crossref
  2. Daniela Lera, Maria Chiara Nasso, Yaroslav D. Sergeyev, 2849, INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2021, 2023, 450013  crossref
  3. Remigijus Paulavičius, Julius Žilinskas, Simplicial Global Optimization, 2014, 21  crossref
  4. R. G. Strongin, D. L. Markin, M. V. Markina, “Reduction of multi-extremum multi-criterion problems with constraints to unconstrained optimization problems: Theory and algorithms”, Comput Math Model, 6, no. 4, 1995, 242  crossref
  5. Yaroslav D. Sergeyev, Roman G. Strongin, Daniela Lera, Introduction to Global Optimization Exploiting Space-Filling Curves, 2013, 9  crossref
  6. Ya. D. Sergeyev, V. A. Grishagin, “Sequential and parallel algorithms for global optimization”, Optimization Methods and Software, 3, no. 1-3, 1994, 111  crossref
  7. Qiang Yang, Yufei Jing, Xudong Gao, Dongdong Xu, Zhenyu Lu, Sang-Woon Jeon, Jun Zhang, “Predominant Cognitive Learning Particle Swarm Optimization for Global Numerical Optimization”, Mathematics, 10, no. 10, 2022, 1620  crossref
  8. Victor Gergel, Evgeny Kozinov, 12137, Computational Science – ICCS 2020, 2020, 17  crossref
  9. Konstantin Barkalov, Victor Gergel, Ilya Lebedev, 1738, 2016, 400006  crossref
  10. Yaroslav D. Sergeyev, “On convergence of "divide the best" global optimization algorithms”, Optimization, 44, no. 3, 1998, 303  crossref
Previous
1
2
3
4
5
6
Next