Pages that link to "Item:Q3956415"

The following pages link to An efficient algorithm for K shortest simple paths (Q3956415):

Displaying 47 items.

• On the second point-to-point undirected shortest simple path problem (Q395858) (← links)
• An efficient time and space \(K\) point-to-point shortest simple paths algorithm (Q449479) (← links)
• Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← links)
• Internet packet routing: application of a \(K\)-quickest path algorithm (Q877587) (← links)
• How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis (Q887851) (← links)
• An interactive approach to identify the best compromise solution for two objective shortest path problems (Q912767) (← links)
• Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm (Q926599) (← links)
• Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems (Q976116) (← links)
• On the \(K\) shortest path trees problem (Q1040982) (← links)
• The hierarchical network design problem (Q1083378) (← links)
• The k most vital arcs in the shortest path problem (Q1119183) (← links)
• An algorithm for finding the \(k\) quickest paths in a network (Q1201855) (← links)
• Finding the \(k\) quickest simple paths in a network (Q1322119) (← links)
• Finding the first \(K\) shortest paths in a time-window network. (Q1427091) (← links)
• Computing and listing \(st\)-paths in public transportation networks (Q1635813) (← links)
• Finding the \(K\) shortest paths in a schedule-based transit network (Q1761096) (← links)
• Voronoi diagrams with barriers and on polyhedra for minimal path planning (Q1822055) (← links)
• An algorithm for ranking quickest simple paths (Q1886854) (← links)
• Finding \(K\) shortest looping paths in a traffic-light network (Q1886860) (← links)
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292) (← links)
• Multiobjective routing problems (Q1919112) (← links)
• Enumerating \(K\) best paths in length order in DAGs (Q1926859) (← links)
• On finding dissimilar paths (Q1969851) (← links)
• An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374) (← links)
• Optimal shortest path set problem in undirected graphs (Q2343975) (← links)
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
• A comprehensive survey on the quickest path problem (Q2379862) (← links)
• The first \(K\) shortest unique-arc walks in a traffic-light network (Q2486756) (← links)
• Improved algorithms for replacement paths problems in restricted graphs (Q2488196) (← links)
• Finding \(K\) shortest looping paths with waiting time in a time--window network (Q2504439) (← links)
• Solving the \(k\)-shortest path problem with time windows in a time varying network (Q2517796) (← links)
• Approximating the Canadian traveller problem with online randomization (Q2663716) (← links)
• Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
• An experimental study on approximating \(k\) shortest simple paths (Q2828199) (← links)
• Distance confined path problem and separable integer programming (Q2841138) (← links)
• Efficiently Listing Bounded Length st-Paths (Q2946068) (← links)
• First passage percolation on locally treelike networks. I. Dense random graphs (Q3624678) (← links)
• Finding the k Shortest Paths (Q4210169) (← links)
• Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
• Finding the k shortest paths in parallel (Q5048947) (← links)
• (Q5111875) (← links)
• A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs (Q5134451) (← links)
• An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem (Q5189094) (← links)
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS (Q5249002) (← links)
• Ranking One Million Simple Paths in Road Networks (Q5506763) (← links)
• Computing and Listing st-Paths in Public Transportation Networks (Q5740180) (← links)
• Finding the \(k\) shortest simple paths: time and space trade-offs (Q6579778) (← links)