{"id":7896,"date":"2022-04-28T21:06:12","date_gmt":"2022-04-28T21:06:12","guid":{"rendered":"https:\/\/www.tun.com\/courses\/2019\/12\/23\/delivery-problem\/"},"modified":"2022-04-28T21:06:13","modified_gmt":"2022-04-28T21:06:13","slug":"delivery-problem","status":"publish","type":"post","link":"https:\/\/www.tun.com\/courses\/delivery-problem\/university-of-california-san-diego\/","title":{"rendered":"Delivery Problem"},"content":{"rendered":"
\n
\n
\n

Description<\/h2>\n

We\u2019ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day \u2014 the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly? We still don\u2019t have provably efficient algorithms for this difficult computational problem and this is the essence of the P versus NP problem, the most important open question in Computer Science. Still, we\u2019ll implement several solutions for real world instances of the travelling salesman problem. While designing these solutions, we will rely heavily on the material learned in the courses of the specialization: proof techniques, combinatorics, probability, graph theory. We\u2019ll see several examples of using discrete mathematics ideas to get more and more efficient solutions.<\/p>\n

Do you have technical problems? Write to us: coursera@hse.ru<\/p>\n

<\/div>\n

Price: Enroll For Free!<\/h2>\n
<\/div>\n
View Class<\/a><\/div>\n
<\/div>\n
\n
\n

Language:<\/strong> <\/em>English<\/p>\n<\/div>\n

\n

Subtitles<\/strong>: <\/em>English<\/p>\n<\/div>\n<\/div>\n

Delivery Problem – University of California San Diego<\/strong><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Description We\u2019ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day \u2014 the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly? We […]<\/p>\n","protected":false},"author":1,"featured_media":19346,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_uag_custom_page_level_css":"","_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_uf_show_specific_survey":0,"_uf_disable_surveys":false,"footnotes":""},"categories":[244],"tags":[],"class_list":["post-7896","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-university-of-california-san-diego"],"aioseo_notices":[],"uagb_featured_image_src":{"full":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/University-of-California-San-Diegoonline-education.png",375,224,false],"thumbnail":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/University-of-California-San-Diegoonline-education-150x150.png",150,150,true],"medium":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/University-of-California-San-Diegoonline-education-300x179.png",300,179,true],"medium_large":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/University-of-California-San-Diegoonline-education.png",375,224,false],"large":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/University-of-California-San-Diegoonline-education.png",375,224,false],"1536x1536":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/University-of-California-San-Diegoonline-education.png",375,224,false],"2048x2048":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/University-of-California-San-Diegoonline-education.png",375,224,false]},"uagb_author_info":{"display_name":"Axiom Pegasus","author_link":"https:\/\/www.tun.com\/courses\/author\/magic\/"},"uagb_comment_info":0,"uagb_excerpt":"Description We\u2019ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day \u2014 the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly? We…","featured_media_src_url":"https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/University-of-California-San-Diegoonline-education.png","_links":{"self":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/posts\/7896","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/comments?post=7896"}],"version-history":[{"count":0,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/posts\/7896\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/media\/19346"}],"wp:attachment":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/media?parent=7896"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/categories?post=7896"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/tags?post=7896"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}