A branch-and-bound algorithm for the double travelling salesman problem with two stacks

Networks ◽  
2012 ◽  
Vol 61 (1) ◽  
pp. 58-75 ◽  
Author(s):  
Francesco Carrabs ◽  
Raffaele Cerulli ◽  
Maria Grazia Speranza
Keyword(s):  
Branch And Bound ◽  
Travelling Salesman Problem ◽  
Branch And Bound Algorithm ◽  
Travelling Salesman

A branch-and-bound algorithm for the time-dependent travelling salesman problem

Networks ◽  
2018 ◽  
Vol 72 (3) ◽  
pp. 382-392 ◽  
Author(s):  
Anna Arigliano ◽  
Tobia Calogiuri ◽  
Gianpaolo Ghiani ◽  
Emanuela Guerriero
Keyword(s):  
Branch And Bound ◽  
Travelling Salesman Problem ◽  
Branch And Bound Algorithm ◽  
Time Dependent ◽  
Travelling Salesman
Sign in / Sign up

Export Citation Format

Share Document