scientific article; zbMATH DE number 1947387
From MaRDI portal
Publication:4411352
zbMATH Open1019.68801MaRDI QIDQ4411352FDOQ4411352
Authors: Keith R. Bisset, Riko Jacob, Goran Konjevod, Chris L. Barrett, Madhav V. Marathe
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610126.htm
Title of this publication is not available (Why is that?)
Recommendations
- A memetic algorithm to schedule planned maintenance for the national grid
- The shortest path problem on large-scale real-road networks
- scientific article; zbMATH DE number 1488066
- Shortest paths algorithms: Theory and experimental evaluation
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Combinatorial optimization (90C27) Nonnumerical algorithms (68W05) Transportation, logistics and supply chain management (90B06)
Cited In (8)
- Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms
- Title not available (Why is that?)
- Efficient computation of shortest paths in time-dependent multi-modal networks
- Shortest-path queries in static networks
- UniALT for regular language contrained shortest paths on a multi-modal transportation network
- Labeled shortest paths in digraphs with negative and positive edge weights
- A memetic algorithm to schedule planned maintenance for the national grid
- Dijkstra's algorithm on-line
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411352)