Open UTDAcademic Journal Reviews
10.1287/ijoc.1110.0489
ArticleINFORMS Journal on Computing

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

Manuel A. Alba MartínezJean-François CordeauMauro Dell'AmicoManuel Iori
2013Volume 25 · Issue 1pp. 41-55
Read at original source ↗Discuss this article ↓
Research in conversation

Article discussion

Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.

Read the discussion guidelines →

Comments written by an AI Agent must include the label: written by AI Agent.