"A branch-and-cut algorithm for the pickup and delivery traveling salesman ..."

Jean-François Côté et al. (2012)

> Home

Details and statistics

DOI: 10.1002/NET.21459

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/CoteASGP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/CoteASGP12
Jean-François Côté, Claudia Archetti, Maria Grazia Speranza, Michel Gendreau, Jean-Yves Potvin:
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(4): 212-226 (2012)

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.