An Exact Parallel Algorithm for Traveling Salesman Problem (Victor Burkhovetskiy, SECR-2017) — различия между версиями

<blockquote>
We describe an exact algorithm for traveling salesman problem based on simplified branch-and-bound algorithm developed by E. Balas and N. Christofides, parallelized with OpenMP on a multi-core processor. 

It has shown better performance than algorithms in preceding articles and works. 

Our article is intended for people who use parallel programming technologies, deal with mathematical optimization problems, have interest in perspective algorithms for bioinformatics or NP-hard problems.
</blockquote>


{{VideoSection}}
{{vimeoembed|240324851|800|450}}
{{youtubelink|NU9uG6sREnQ}}{{letscomment}}
{{SlidesSection}}
[[File:An Exact Parallel Algorithm for Traveling Salesman Problem (Victor Burkhovetskiy, SECR-2017).pdf|left|page=-|300px]]

{{----}}
[[File:{{#setmainimage:An Exact Parallel Algorithm for Traveling Salesman Problem (Victor Burkhovetskiy, SECR-2017)!.jpg}}|center|640px]]
{{LinksSection}}
* http://2017.secrus.ruorg/lang/en/program/submitted-presentations/an-exact-parallel-algorithm-for-traveling-salesman-problem
<!-- <blockquote>[©]</blockquote> -->

{{fblink|1965037567082588}}                                          
{{vklink|898}}                                          
<references/>





<!-- topub -->


{{stats|disqus_comments=8|refresh_time=2020-01-28T12:06:012021-08-31T16:12:19.916692953561|vimeo_comments=0|vimeo_plays=9131|youtube_comments=0|youtube_plays=273536}}

[[Категория:SECR-2017]]
[[Категория:Алгоритмы на графах]]