A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks

Manuel A. Alba Martínez, Jean-François Cordeau, Mauro Dell'Amico, Manuel Iori. A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. INFORMS Journal on Computing, 25(1):41-55, 2013. [doi]

@article{MartinezCDI13-0,
  title = {A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks},
  author = {Manuel A. Alba Martínez and Jean-François Cordeau and Mauro Dell'Amico and Manuel Iori},
  year = {2013},
  doi = {10.1287/ijoc.1110.0489},
  url = {http://dx.doi.org/10.1287/ijoc.1110.0489},
  researchr = {https://researchr.org/publication/MartinezCDI13-0},
  cites = {0},
  citedby = {0},
  journal = {INFORMS Journal on Computing},
  volume = {25},
  number = {1},
  pages = {41-55},
}