Pages that link to "Item:Q1309941"
From MaRDI portal
The following pages link to An algorithm for the ranking of shortest paths (Q1309941):
Displayed 13 items.
- A multi-modal approach to the location of a rapid transit line (Q1291658) (← links)
- A computational improvement for a shortest paths ranking algorithm (Q1328620) (← links)
- Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
- Shortest route computation in distributed systems (Q1885965) (← links)
- Finding \(K\) shortest looping paths in a traffic-light network (Q1886860) (← links)
- Multiobjective routing problems (Q1919112) (← links)
- Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885) (← links)
- The fastest itinerary in time-dependent decentralized travel information systems (Q2369978) (← links)
- Finding \(K\) shortest looping paths with waiting time in a time--window network (Q2504439) (← links)
- Efficient algorithms to find optimal paths in a public transportation network (Q4338573) (← links)
- Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa (Q4419274) (← links)
- A bicriterion approach for routing problems in multimedia networks (Q4419277) (← links)