Enumerating K best paths in length order in DAGs
Year of publication: |
2012
|
---|---|
Authors: | Pascoal, Marta M.B. ; Sedeño-Noda, Antonio |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 221.2012, 2 (1.9.), p. 308-317
|
Saved in:
Saved in favorites
Similar items by person
-
Enumerating K best paths in length order in DAGs
Pascoal, Marta M.B., (2012)
-
On the bicriterion - minimal cost/minimal label - spanning tree problem
Clímaco, João C.N., (2010)
-
Internet packet routing: Application of a K-quickest path algorithm
Climaco, Joao C.N., (2007)
- More ...