33 citations to 10.1023/A:1022512411995 (Crossref Cited-By Service)
  1. J. A. Martínez, L. G. Casado, I. García, B. Tóth, 74, Frontiers in Global Optimization, 2004, 313  crossref
  2. Nicolas Delanoue, Mehdi Lhommeau, Philippe Lucidarme, “Numerical enclosures of the optimal cost of the Kantorovitch’s mass transportation problem”, Comput Optim Appl, 63, № 3, 2016, 855  crossref
  3. K Hamacher, “Adaptation in stochastic tunneling global optimization of complex potential energy landscapes”, Europhys. Lett., 74, № 6, 2006, 944  crossref
  4. Samiran Karmakar, Asoke Kumar Bhunia, “An efficient interval computing technique for bound-constrained uncertain optimization problems”, Optimization, 63, № 11, 2014, 1615  crossref
  5. Priyanka Roy, Geetanjali Panda, Dong Qiu, “Gradient-based descent linesearch to solve interval-valued optimization problems under gH-differentiability with application to finance”, Journal of Computational and Applied Mathematics, 436, 2024, 115402  crossref
  6. Federico Cabassi, Luca Consolini, Marco Locatelli, “Time-optimal velocity planning by a bound-tightening technique”, Comput Optim Appl, 70, № 1, 2018, 61  crossref
  7. S. Karmakar, S.K. Mahato, A.K. Bhunia, “Interval oriented multi-section techniques for global optimization”, Journal of Computational and Applied Mathematics, 224, № 2, 2009, 476  crossref
  8. D.G. Sotiropoulos, T.N. Grapsa, “Optimal centers in branch-and-prune algorithms for univariate global optimization”, Applied Mathematics and Computation, 169, № 1, 2005, 247  crossref
  9. S. K. Mahato, A. K. Bhunia, “Interval-arithmetic-oriented interval computing technique for global optimization”, Applied Mathematics Research eXpress, 2006  crossref
  10. Mikhail Posypkin, Oleg Khamisov, “Automatic Convexity Deduction for Efficient Function’s Range Bounding”, Mathematics, 9, № 2, 2021, 134  crossref
1
2
3
4
Следующая