55 citations to https://www.mathnet.ru/rus/at1543
  1. Hyangsuuk Lee, Maowei Chen, Sangho Choo, “Developing an Optimal Location Selection Methodology of Unmanned Parcel Service Box”, J. Korea Inst. Intelligent. Transp. Syst., 16:4 (2017), 13  crossref
  2. Ozpeynirci O., Aglamaz E., “Pharmacy Duty Scheduling Problem”, Int. Trans. Oper. Res., 23:3 (2016), 459–480  crossref  mathscinet  zmath  isi  scopus
  3. Carling K., Meng X., “on Statistical Bounds of Heuristic Solutions To Location Problems”, J. Comb. Optim., 31:4 (2016), 1518–1549  crossref  mathscinet  zmath  isi  elib  scopus
  4. Kaveh A., Mahdavi V.R., “Optimal Domain Decomposition Using Colliding Bodies Optimization and K-Median Method”, Finite Elem. Anal. Des., 98 (2015), 41–49  crossref  mathscinet  isi  elib  scopus
  5. Brusco M.J., Steinley D., “Affinity Propagation and Uncapacitated Facility Location Problems”, J. Classif., 32:3 (2015), 443–480  crossref  mathscinet  zmath  isi  elib  scopus
  6. Carling K., Meng X., “Confidence in Heuristic Solutions?”, J. Glob. Optim., 63:2 (2015), 381–399  crossref  mathscinet  zmath  isi  elib  scopus
  7. A. Kaveh, V. R. Mahdavi, Colliding Bodies Optimization, 2015, 237  crossref
  8. Kocaturk F., Ozpeynirci O., “Variable Neighborhood Search For the Pharmacy Duty Scheduling Problem”, Comput. Oper. Res., 51 (2014), 218–226  crossref  zmath  isi  elib  scopus
  9. Meng X., Carling K., “How To Decide Upon Stopping a Heuristic Algorithm in Facility-Location Problems?”, Web Information Systems Engineering - Wise 2013 Workshops, Lecture Notes in Computer Science, 8182, eds. Huang Z., Liu C., He J., Huang G., Springer-Verlag Berlin, 2014, 280–283  crossref  isi  scopus
  10. Mehmet Sevkli, Ruslan Mamedsaidov, Fatih Camci, “A novel discrete particle swarm optimization for p-median problem”, Journal of King Saud University - Engineering Sciences, 26:1 (2014), 11  crossref
Предыдущая
1
2
3
4
5
6
Следующая