scientific article; zbMATH DE number 1982185
From MaRDI portal
Publication:4426354
zbMath1023.68876MaRDI QIDQ4426354
Andrés Marzal, Víctor Manuel Jiménez
Publication date: 16 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2647/26470179.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Choquet-based optimisation in multiobjective shortest path and spanning tree problems ⋮ K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Finding \(K\) shortest looping paths with waiting time in a time--window network ⋮ A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs
This page was built for publication:
