Pages that link to "Item:Q3330993"
From MaRDI portal
The following pages link to Shortest-path algorithms: Taxonomy and annotation (Q3330993):
Displaying 50 items.
- Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations (Q323012) (← links)
- A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network (Q505166) (← links)
- Solving the constrained shortest path problem using random search strategy (Q546424) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Complexity analysis and optimization of the shortest path tour problem (Q691420) (← links)
- Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications (Q707245) (← links)
- A parametric approach to solving bicriterion shortest path problems (Q810382) (← links)
- Location of central nodes in time varying computer networks (Q811350) (← links)
- The quickest path problem (Q912765) (← links)
- An interactive approach to identify the best compromise solution for two objective shortest path problems (Q912767) (← links)
- Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
- The hierarchical network design problem (Q1083378) (← links)
- Transitive closure and related semiring properties via eliminants (Q1089083) (← links)
- A parallel shortest path algorithm (Q1112621) (← links)
- Parallel algorithms for the single source shortest path problem (Q1162156) (← links)
- Weighted min cost flows (Q1168883) (← links)
- An algorithm for finding the \(k\) quickest paths in a network (Q1201855) (← links)
- Network reduction for the acyclic constrained shortest path problem (Q1206607) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- On the quickest path problem (Q1261485) (← links)
- An algorithm for the ranking of shortest paths (Q1309941) (← links)
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths (Q1318506) (← links)
- Finding the \(k\) quickest simple paths in a network (Q1322119) (← links)
- Dynamic expression trees (Q1346771) (← links)
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network (Q1367872) (← links)
- Minimum time paths in a network with mixed time constraints. (Q1406690) (← links)
- On the sum-max bicriterion path problem. (Q1406718) (← links)
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network (Q1630202) (← links)
- Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
- Minimization of travel time and weighted number of stops in a traffic-light network (Q1869410) (← links)
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem (Q1869695) (← links)
- Finding \(K\) shortest looping paths in a traffic-light network (Q1886860) (← links)
- Intelligent transportation systems -- Enabling technologies (Q1906952) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- Analyzing the reachability problem in choice networks (Q2170221) (← links)
- Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
- New algorithms for multi objective shortest path problem. (Q2477107) (← links)
- Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics (Q2478380) (← links)
- The first \(K\) shortest unique-arc walks in a traffic-light network (Q2486756) (← links)
- Symmetric connection problems and their solution by bidirectional search (Q3210917) (← links)
- Information tradeoffs in model building: A network routing application (Q3354612) (← links)
- Approximating the Stochastic Network by its <i>M</i> Shortest Paths (Q3415944) (← links)
- UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS (Q3422198) (← links)
- The determination of the path with minimum-cost norm value (Q4419275) (← links)
- Efficient modeling of travel in networks with time-varying link speeds (Q4519129) (← links)
- (Q4520239) (← links)
- Searching among intervals and compact routing tables (Q4630246) (← links)
- New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems (Q4653708) (← links)
- (Q4741699) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
