"A minmax regret version of the time-dependent shortest path problem."

Eduardo Conde, Marina Leal, Justo Puerto (2018)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2018.04.030

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/CondeLP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/CondeLP18
Eduardo Conde, Marina Leal, Justo Puerto:
A minmax regret version of the time-dependent shortest path problem. Eur. J. Oper. Res. 270(3): 968-981 (2018)

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.