Pages that link to "Item:Q1309941"
From MaRDI portal
The following pages link to An algorithm for the ranking of shortest paths (Q1309941):
Displaying 32 items.
- Considering en-route choices in utility-based route choice modelling (Q291692) (← links)
- Exploring trust region method for the solution of logit-based stochastic user equilibrium problem (Q297055) (← links)
- DTA2012 symposium: Combining disaggregate route choice estimation with aggregate calibration of a dynamic traffic assignment model (Q298921) (← links)
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs (Q336675) (← links)
- An algorithm for ranking paths that may contain cycles (Q759658) (← links)
- 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)
- A new implementation of Yen's ranking loopless paths algorithm (Q1432016) (← links)
- Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
- Congestion avoiding heuristic path generation for the proactive route guidance (Q1654374) (← links)
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem (Q1761957) (← 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)
- An algorithm for ranking quickest simple paths (Q1886854) (← 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)
- Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints (Q2083941) (← links)
- A modified truncated Newton algorithm for the logit-based stochastic user equilibrium problem (Q2282643) (← links)
- Improving truncated Newton method for the logit-based stochastic user equilibrium problem (Q2298743) (← links)
- Shortest paths with ordinal weights (Q2327649) (← links)
- The fastest itinerary in time-dependent decentralized travel information systems (Q2369978) (← links)
- Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362) (← links)
- Finding \(K\) shortest looping paths with waiting time in a time--window network (Q2504439) (← links)
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size (Q2669769) (← links)
- Interactive in-vehicle guidance through a multihierarchical representation of urban maps (Q3065303) (← 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)
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem (Q5084630) (← links)
- A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs (Q5134451) (← links)
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS (Q5249002) (← links)
