addressalign-toparrow-leftarrow-right-10x10arrow-rightbackbellblockcalendarcameraccwcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-checkcircle-with-crosscircle-with-pluscontroller-playcredit-cardcrossdots-three-verticaleditemptyheartexporteye-with-lineeyefacebookfolderfullheartglobe--smallglobegmailgooglegroupshelp-with-circleimageimagesinstagramFill 1languagelaunch-new-window--smalllight-bulblinklocation-pinlockm-swarmSearchmailmediummessagesminusmobilemoremuplabelShape 3 + Rectangle 1ShapeoutlookpersonJoin Group on CardStartprice-ribbonprintShapeShapeShapeShapeImported LayersImported LayersImported Layersshieldstartickettrashtriangle-downtriangle-uptwitteruserwarningyahooyoutube

Fwd: Travelling Salesman Challenge 2.0

From: Laura Pérez M.
Sent on: Friday, October 12, 2018 7:22 PM

---------- Forwarded message ---------

Dear Pythonistas,

Do you love programming challenges? Solve this one by and win a trip around the world. It’s a great opportunity to have some fun with an NP-hard problem!

Your task is to determine the cheapest possible connection between specific areas, where an area is a set of cities.

Can you do that? Join the Travelling Salesman Challenge 2.0.

Learn more at

Paulina Montes / Office Administrator & Community Ambassador
Mail: [address removed]
Tel: [masked]
Address: Ronda Sant Pere 52, entresuelo, 08010 Barcelona
Follow technological community: 

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy