"Solving the k-shortest path problem with time windows in a time varying ..."

Konstantinos N. Androutsopoulos, Konstantinos G. Zografos (2008)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2008.07.003

access: closed

type: Journal Article

metadata version: 2017-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/AndroutsopoulosZ08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/AndroutsopoulosZ08
Konstantinos N. Androutsopoulos, Konstantinos G. Zografos:
Solving the k-shortest path problem with time windows in a time varying network. Oper. Res. Lett. 36(6): 692-695 (2008)

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.