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)- Ein neuer Algorithmus zur Bestimmung von k-kürzesten Wegen in einem Graphen
- Ein leistungsfähiger Algorithmus zur Bestimmung von K-kürzesten Wegen in einem Graphen
- On a technique for finding running tracks of specific length in a road network
- An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- On the shortest path problem with negative cost cycles
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
- Solving the \(k\)-shortest path problem with time windows in a time varying network
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
- Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account
- Evasive flow capture: a multi-period stochastic facility location problem with independent demand
- Finding shortest and dissimilar paths
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
- Finding the K mean-standard deviation shortest paths under travel time uncertainty
- \(k\)-shortest routing of trains on shunting yards
- A bi-objective decision model and method for the integrated optimization of bus line planning and Lane reservation
- Vertex labeling and routing for Farey-type symmetrically-structured graphs
- Implementation of algorithms forK shortest loopless paths
- Ein Verfahren zur Alternativroutensuche in Verkehrsnetzen
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- Candidate sets for alternative routes in road networks
- A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
- Low time complexity algorithms for path computation in Cayley graphs
- Shelter location-allocation problem for disaster evacuation planning: a simulation optimization approach
- Algorithm for solving K-shortest paths problem in complicated network
- An operation-agnostic stochastic user equilibrium model for mobility-on-demand networks with congestible capacities
- Generating price-effective intermodal routes
- Transducing Markov sequences
- Improving scheduling in multi-AGV systems by task prediction
- A bicriterion approach for routing problems in multimedia networks
- Road traffic estimation and algorithmic routing in a spatially dependent network
- scientific article; zbMATH DE number 1854091 (Why is no real title available?)
- Multiobjective swarm intelligence for the traffic grooming problem
- Traffic graph convolutional network for dynamic urban travel speed estimation
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
- An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
- Evaluation and enumeration problems for regular path queries
- Finding the \(k\) shortest simple paths: time and space trade-offs
- Multi-commodity distribution under uncertainty in disaster response phase: model, solution method, and an empirical study
- k-shortest simple paths in bounded treewidth graphs
- Graceful reassignment of excessively long communications paths in networks
- scientific article; zbMATH DE number 4066938 (Why is no real title available?)
- Routing of a hazmat truck in the presence of weather systems
- An algorithm for the resource constrained shortest path problem
- Targeted and contextual redescription set exploration
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
- Improving post-disaster road network accessibility by strengthening links against failures
- Finding the \(k\) shortest paths in parallel
- Fast computation of bounds for two-terminal network reliability
- Large-scale periodic scheduling in time-sensitive networks
- Computing and listing \(st\)-paths in public transportation networks
- Algorithms for the quickest path problem and the reliable quickest path problem
- Computing and listing \(st\)-paths in public transportation networks
- Ordered weighted average optimization in multiobjective spanning tree problem
- Computingk-shortest path lengths in euclidean networks
- Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
- ATM VP-based network design
- Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
- Efficiently listing bounded length \(st\)-paths
- Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction
- The multiple shortest path problem with path deconfliction
- Neural and delay based heuristics for the Steiner problem in networks
- An efficient time and space K point-to-point shortest simple paths algorithm
- Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem
- A model for tonal progressions of seventh chords
- The first K shortest unique-arc walks in a traffic-light network
- Two extended formulations for the virtual network function placement and routing problem
- The k-dissimilar vehicle routing problem
- Finding minimum and equitable risk routes for hazmat shipments
- A new implementation of Yen's ranking loopless paths algorithm
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
- The equity constrained shortest path problem
- Any-k algorithms for enumerating ranked answers to conjunctive queries
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
- Congestion avoiding heuristic path generation for the proactive route guidance
- Finding the \(K\) shortest paths in a schedule-based transit network
- Finding theKth shortest path in a time-schedule network
- A route set construction algorithm for the transit network design problem
- On the \(K\) shortest path trees problem
- Methods for determining cycles of a specific length in undirected graphs with edge weights
- Fracture network flow prediction with uncertainty using physics-informed graph features
- Simultaneous location and vehicle fleet sizing of relief goods distribution centers and vehicle routing for post-disaster logistics
- How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis
- Multiple-path selection for new highway alignments using discrete algorithms
- Integrated approach to network design and frequency setting problem in railway rapid transit systems
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- An algorithm for finding the \(k\) quickest paths in a network
- A Catalog of Formulations for the Network Pricing Problem
- The ripple-spreading algorithm for shortest path tour problems
- An algorithm for the ranking of shortest paths
- Finding the Minimum-Weight k-Path
- Equitable routing of rail hazardous materials shipments using CVaR methodology
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)
