"A branch-and-cut algorithm for the partitioning-hub location-routing problem."

Daniele Catanzaro et al. (2011)

> Home

Details and statistics

DOI: 10.1016/J.COR.2010.07.014

access: closed

type: Journal Article

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/CatanzaroGLO11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/CatanzaroGLO11
Daniele Catanzaro, Éric Gourdin, Martine Labbé, F. Aykut Özsoy:
A branch-and-cut algorithm for the partitioning-hub location-routing problem. Comput. Oper. Res. 38(2): 539-549 (2011)

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.