text:   Salesman Problem",3,"['New exponential-size neighborhoods for the pickup-and-delivery problem. Optimal solutions are attained for most problems with up to 30 nodes in a *single* local-search descent, giving 1,000x speedup over previous algorithms! Check our paper here:\n<LINK>\n#ORMS <LINK>', 'work with Toni Pacheco, Rafael Martinelli (@rafaelmartinel8), Tulio Toffolo (@tuliotoffolo) and Anand Subramanian (@Subjectto_)', '👉@pacheco_toni']",21,07,409