"NP-hardness of shortest path problems in networks with non-FIFO ..."

Tim Zeitz (2023)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2022.106287

access: closed

type: Journal Article

metadata version: 2022-11-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Zeitz23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Zeitz23
Tim Zeitz:
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times. Inf. Process. Lett. 179: 106287 (2023)

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.