The following pages link to (Q3128914):
Displaying 18 items.
- A mathematical model proposal for cost-effective course planning in large hierarchical organizations (Q296813) (← links)
- A generalization of binomial queues (Q672741) (← links)
- Implementation and analysis of alternative algorithms for generalized shortest path problems (Q1086499) (← links)
- A computational study of efficient shortest path algorithms (Q1112733) (← links)
- Shortest path algorithms: A computational study with the C programming language (Q1184466) (← links)
- A computational improvement for a shortest paths ranking algorithm (Q1328620) (← links)
- Unified all-pairs shortest path algorithms in the chordal hierarchy (Q1364781) (← links)
- Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms. (Q1413809) (← links)
- A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. (Q1607102) (← links)
- Shortest path solvers. From software to wetware (Q1753985) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- On the equivalence between some shortest path algorithms (Q2638955) (← links)
- PRACTICAL EFFICIENCIES OF EXISTING SHORTEST-PATH ALGORITHMS AND A NEW BUCKET ALGORITHM (Q3315293) (← links)
- Shortest-path algorithms: Taxonomy and annotation (Q3330993) (← links)
- The shortest path problem on large-scale real-road networks (Q3418206) (← links)
- Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem (Q3557808) (← links)
- A Multi-agent Home Automation System for Power Management (Q3564218) (← links)
- A memetic algorithm to schedule planned maintenance for the national grid (Q5463391) (← links)
