"Polyhedral results and a branch-and-cut algorithm for the double traveling ..."

Michele Barbato et al. (2016)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2016.04.005

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/disopt/BarbatoGLC16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/BarbatoGLC16
Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo:
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks. Discret. Optim. 21: 25-41 (2016)

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.