"A Dijkstra-like method computing all extreme supported non-dominated ..."

Antonio Sedeño-Noda, Andrea Raith (2015)

> Home

Details and statistics

DOI: 10.1016/J.COR.2014.11.010

access: closed

type: Journal Article

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/Sedeno-NodaR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/Sedeno-NodaR15
Antonio Sedeño-Noda, Andrea Raith:
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Comput. Oper. Res. 57: 83-94 (2015)

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.