"Branch-price-and-cut algorithms for the pickup and delivery problem with ..."

Marilène Cherkesly et al. (2016)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2015.10.046

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/CherkeslyDIL16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/CherkeslyDIL16
Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte:
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. Eur. J. Oper. Res. 250(3): 782-793 (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.