"Algorithms for the Minmax Regret Path problem with interval data."

Francisco Pérez-Galarce et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.INS.2018.06.016

access: closed

type: Journal Article

metadata version: 2021-02-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/isci/Perez-GalarceCA18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/isci/Perez-GalarceCA18
Francisco Pérez-Galarce, Alfredo Candia-Véjar, César A. Astudillo, Matthew Bardeen:
Algorithms for the Minmax Regret Path problem with interval data. Inf. Sci. 462: 218-241 (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.