"A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with ..."

Manuel A. Alba Martínez et al. (2013)

> Home

Details and statistics

DOI: 10.1287/IJOC.1110.0489

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/MartinezCDI13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/MartinezCDI13
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 J. Comput. 25(1): 41-55 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.