"Computing strong lower and upper bounds for the integrated multiple-depot ..."

Markó Horváth, Tamás Kis (2019)

> Home

Details and statistics

DOI: 10.1007/S10100-017-0489-4

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cejor/HorvathK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cejor/HorvathK19
Markó Horváth, Tamás Kis:
Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price. Central Eur. J. Oper. Res. 27(1): 39-67 (2019)

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.