Εμφανίζονται 1 - 8 Αποτελέσματα από 8 για την αναζήτηση '"рандомизированный алгоритм"', χρόνος αναζήτησης: 0,54δλ Περιορισμός αποτελεσμάτων
  1. 1
  2. 2
  3. 3
    Academic Journal

    Συγγραφείς: M. S. Barketau, М. С. Баркетов

    Πηγή: Doklady of the National Academy of Sciences of Belarus; Том 66, № 5 (2022); 489-494 ; Доклады Национальной академии наук Беларуси; Том 66, № 5 (2022); 489-494 ; 2524-2431 ; 1561-8323 ; 10.29235/1561-8323-2022-66-5

    Περιγραφή αρχείου: application/pdf

    Relation: https://doklady.belnauka.by/jour/article/view/1087/1085; Arora, S. Polynomial time approximation schemes for Euclidean TSP and other geometric problems / S. Arora // Proceedings of 37th Conference on Foundations of Computer Science. – 1996. – P. 2–11. https://doi.org/10.1109/sfcs.1996.548458; Svensson, O. Approximating ATSP by relaxing connectivity / O. Svensson // IEEE 56th Annual Symposium on Foundations of Computer Science. – 2015. – P. 1–19. https://doi.org/10.1109/focs.2015.10; Burke, E. Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem / E. Burke, P. Cowling, R. Keuthen // Workshops on Applications of Evolutionary Computation. – Berlin, Heidelberg: Springer, 2001. – P. 203–212. https://doi.org/10.1007/3-540-45365-2_21; Fischetti, M. Exact methods for the asymmetric traveling salesman problem / M. Fischetti, A. Lodi, P. Toth // The traveling salesman problem and its variations. – Boston, MA: Springer, 2007. – P. 169–205. https://doi.org/10.1007/0-306-48213-4_4; https://doklady.belnauka.by/jour/article/view/1087

  4. 4
  5. 5
  6. 6
  7. 7
    Academic Journal

    Πηγή: Вестник Санкт-Петербургского университета. Серия 10. Прикладная математика. Информатика. Процессы управления.

    Περιγραφή αρχείου: text/html

  8. 8