scientific article; zbMATH DE number 1947387

MaRDI QIDQ4411352zbMATH OpenFDO

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Nonnumerical algorithms (68W05) Transportation, logistics and supply chain management (90B06)

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

Cited in

(8)

• Efficient computation of shortest paths in time-dependent multi-modal networks
• Shortest-path queries in static networks
• Dijkstra's algorithm on-line
• Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms
• A memetic algorithm to schedule planned maintenance for the national grid
• Labeled shortest paths in digraphs with negative and positive edge weights
• scientific article; zbMATH DE number 5260074 (Why is no real title available?)
• UniALT for regular language contrained shortest paths on a multi-modal transportation network

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)