Finding the K Shortest Loopless Paths in a Network
From MaRDI portal
Publication:5623536
Recommendations
- Implementation of algorithms forK shortest loopless paths
- An algorithm for the ranking of shortest paths
- A k shortest path algorithm for adaptive routing in communications networks
- Near-shortest and K-shortest simple paths
- An efficient implementation of an algorithm for findingK shortest simple paths
Cited in
(only showing first 100 items - show all)- A route set construction algorithm for the transit network design problem
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
- On the \(K\) shortest path trees problem
- Flows with unit path capacities and related packing and covering problems
- An algorithm for ranking paths in acyclic networks
- Allowable processing orders in the accelerated cascade algorithm
- An algorithm for finding the \(k\) quickest paths in a network
- Ein neuer Algorithmus zur Bestimmung von k-kürzesten Wegen in einem Graphen
- Ein Verfahren zur Alternativroutensuche in Verkehrsnetzen
- Neural and delay based heuristics for the Steiner problem in networks
- An algorithm for the ranking of shortest paths
- Finding the \(k\) quickest simple paths in a network
- Ein leistungsfähiger Algorithmus zur Bestimmung von K-kürzesten Wegen in einem Graphen
- Finding the first \(K\) shortest paths in a time-window network.
- A new implementation of Yen's ranking loopless paths algorithm
- Heuristics for the stochastic/dynamic user-optimal route choice problem
- Unified approach to fuzzy graph problems
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
- Targeted and contextual redescription set exploration
- Computing and listing \(st\)-paths in public transportation networks
- Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
- Integrated approach to network design and frequency setting problem in railway rapid transit systems
- Congestion avoiding heuristic path generation for the proactive route guidance
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Ranking robustness and its application to evacuation planning
- Delay resistant line planning with a view towards passenger transfers
- A study of network violator interception based on a reliable game model
- Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account
- Low time complexity algorithms for path computation in Cayley graphs
- Improving post-disaster road network accessibility by strengthening links against failures
- Evasive flow capture: a multi-period stochastic facility location problem with independent demand
- Ordered weighted average optimization in multiobjective spanning tree problem
- Finding the \(K\) shortest paths in a schedule-based transit network
- Finding the K shortest hyperpaths
- Combination of piecewise-geodesic paths for interactive segmentation
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- A penalty function heuristic for the resource constrained shortest path problem
- An algorithm for ranking quickest simple paths
- Finding \(K\) shortest looping paths in a traffic-light network
- Graceful reassignment of excessively long communications paths in networks
- Multiobjective routing problems
- Enumerating \(K\) best paths in length order in DAGs
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
- On finding dissimilar paths
- Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction
- The multiple shortest path problem with path deconfliction
- Combinatorial optimization algorithms for detecting collapse mechanisms of concrete slabs
- Efficient single-pair all-shortest-path query processing for massive dynamic networks
- Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints
- Multiple train repositioning operations in a railyard network
- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
- A bi-objective decision model and method for the integrated optimization of bus line planning and Lane reservation
- Multi-commodity distribution under uncertainty in disaster response phase: model, solution method, and an empirical study
- Path planning for robotic teams based on LTL specifications and Petri net models
- Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks
- Physics-informed machine learning for backbone identification in discrete fracture networks
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
- Vertex labeling and routing for Farey-type symmetrically-structured graphs
- Multiobjective swarm intelligence for the traffic grooming problem
- Optimal shortest path set problem in undirected graphs
- Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
- Finding outbreak trees in networks with limited information
- Path assignment for call routing: An application of tabu search
- A network-based model for transporting extremely hazardous materials
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- A comprehensive survey on the quickest path problem
- On the online multi-agent O-D \(k\)-Canadian traveler problem
- Object modeling and path computation for multimodal travel systems
- The first K shortest unique-arc walks in a traffic-light network
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Ranking paths in stochastic time-dependent networks
- Solving the \(k\)-shortest path problem with time windows in a time varying network
- An optimal algorithm for the obstacle neutralization problem
- Equitable routing of rail hazardous materials shipments using CVaR methodology
- Benders decomposition for a node-capacitated virtual network function placement and routing problem
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- Large-scale periodic scheduling in time-sensitive networks
- Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Hexahedral mesh re-parameterization from aligned base-complex
- Candidate sets for alternative routes in road networks
- An experimental study on approximating k shortest simple paths
- Distance confined path problem and separable integer programming
- Finding the Minimum-Weight k-Path
- Efficiently listing bounded length \(st\)-paths
- Fast computation of bounds for two-terminal network reliability
- A GRASP algorithm for a capacitated, fixed charge, multicommodity network flow problem with uncertain demand and survivability constraints
- Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
- The k-dissimilar vehicle routing problem
- Multiple-path selection for new highway alignments using discrete algorithms
- Evaluation and enumeration problems for regular path queries
- Finding the K shortest paths in a time-schedule network with constraints on arcs
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem
- Effective algorithms for a class of discrete valued optimal control problems
- Algorithm for solving K-shortest paths problem in complicated network
This page was built for publication: Finding the K Shortest Loopless Paths in a Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5623536)
