A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem

  1. Sedeño-Noda, A.
  2. Raith, A.
Aldizkaria:
Computers and Operations Research

ISSN: 0305-0548

Argitalpen urtea: 2015

Alea: 57

Orrialdeak: 83-94

Mota: Artikulua

DOI: 10.1016/J.COR.2014.11.010 GOOGLE SCHOLAR
Datuen iturria: Scopus