Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph Научная публикация
| Журнал |
Discrete Applied Mathematics
ISSN: 0166-218X |
||||
|---|---|---|---|---|---|
| Вых. Данные | Год: 2015, Том: 196, Страницы: 54-61 Страниц : 8 DOI: 10.1016/j.dam.2015.03.007 | ||||
| Ключевые слова | Asymmetric m-Peripatetic Salesman Problem; Asymptotic optimality; Disjoint Hamiltonian circuits; Performance guarantees; Polynomial algorithm; Random inputs | ||||
| Авторы |
|
||||
| Организации |
|
Библиографическая ссылка:
Gimadi E.K.
, Glebov A.N.
, Skretneva A.A.
, Tsidulko O.Y.
, Zambalaeva D.Z.
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
Discrete Applied Mathematics. 2015. V.196. P.54-61. DOI: 10.1016/j.dam.2015.03.007 WOS Scopus OpenAlex
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
Discrete Applied Mathematics. 2015. V.196. P.54-61. DOI: 10.1016/j.dam.2015.03.007 WOS Scopus OpenAlex
Идентификаторы БД:
| Web of science: | WOS:000362605700005 |
| Scopus: | 2-s2.0-84954379110 |
| OpenAlex: | W2037601619 |