scientific article; zbMATH DE number 4035604
From MaRDI portal
Publication:3775353
Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)
Recommendations
- Heuristic shortest path algorithms for transportation applications: state of the art
- A Shortest Path Algorithm Based on Limited Search Heuristics
- Heuristic estimates in shortest path algorithms
- scientific article; zbMATH DE number 3952519
- Program realization of shortest path algorithms in transportation MIS
Cited in
(8)- T*: a weighted double-heuristic search algorithm to find the shortest path
- Heuristic shortest path algorithms for transportation applications: state of the art
- A new intelligence algorithm for determination of shortest path for dynamic guidance of vehicles based on service level criterion
- N-shortest paths retrieval algorithm based on artificial immunity
- Heuristic estimates in shortest path algorithms
- A heuristic optimization path-finding algorithm based on Dijkstra algorithm
- Computational Science - ICCS 2004
- A heuristic for the location of a rapid transit 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 Q3775353)
