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 new implementation of Yen's ranking loopless paths algorithm
- Finding theKth shortest path in a time-schedule network
- Optimization and probabilistic satisfiability on nested and co-nested formulas
- Assessing the reliability and the expected performance of a network under disaster risk
- Finding \(K\) shortest looping paths in a traffic-light network
- An algorithm for finding the \(k\) quickest paths in a network
- Multi-commodity distribution under uncertainty in disaster response phase: model, solution method, and an empirical study
- Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
- An algorithm for the ranking of shortest paths
- Unified approach to fuzzy graph problems
- Effective algorithms for a class of discrete valued optimal control problems
- Path assignment for call routing: An application of tabu search
- How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis
- Finding the first \(K\) shortest paths in a time-window network.
- scientific article; zbMATH DE number 599010 (Why is no real title available?)
- A k shortest path algorithm for adaptive routing in communications networks
- A parametric approach to solving bicriterion shortest path problems
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- The minmax regret robust shortest path problem in a finite multi-scenario model
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- Regenerator location problem in flexible optical networks
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- The equity constrained shortest path problem
- Routing of a hazmat truck in the presence of weather systems
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Multiobjective routing problems
- A Catalog of Formulations for the Network Pricing Problem
- Finding next-to-shortest paths in a graph
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
- Finding the \(K\) shortest paths in a schedule-based transit network
- An algorithm for ranking quickest simple paths
- On discrete optimization with ordering
- Solving the \(k\)-shortest path problem with time windows in a time varying network
- Algorithms for the quickest path problem and the reliable quickest path problem
- Integrated approach to network design and frequency setting problem in railway rapid transit systems
- A network-based model for transporting extremely hazardous materials
- An exact algorithm for the network pricing problem
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
- Implementation of algorithms forK shortest loopless paths
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
- Finding shortest and dissimilar paths
- A comprehensive survey on the quickest path problem
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Object modeling and path computation for multimodal travel systems
- Finding the k Shortest Paths
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- On finding dissimilar paths
- The \(k\)-dissimilar vehicle routing problem
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
- Multiple-path selection for new highway alignments using discrete algorithms
- Ranking paths in stochastic time-dependent networks
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
- Deviation algorithms for ranking shortest paths
- Finding the \(K\) shortest hyperpaths
- A route set construction algorithm for the transit network design problem
- An algorithm for the resource constrained shortest path problem
- Finding the Minimum-Weight k-Path
- A penalty function heuristic for the resource constrained shortest path problem
- An efficient time and space \(K\) point-to-point shortest simple paths algorithm
- A multiobjective evolutionary algorithm based on decomposition with normal boundary intersection for traffic grooming in optical networks
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
- Finding the \(k\) quickest simple paths in a network
- Finding minimum and equitable risk routes for hazmat shipments
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- A bicriterion approach for routing problems in multimedia networks
- Fast computation of bounds for two-terminal network reliability
- ATM VP-based network design
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
- \(k\)-shortest routing of trains on shunting yards
- Optimal shortest path set problem in undirected graphs
- On the \(K\) shortest path trees problem
- scientific article; zbMATH DE number 1854091 (Why is no real title available?)
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
- Computing and listing \(st\)-paths in public transportation networks
- A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
- Hexahedral mesh re-parameterization from aligned base-complex
- Flows with unit path capacities and related packing and covering problems
- Benders decomposition for a node-capacitated virtual network function placement and routing problem
- Traffic graph convolutional network for dynamic urban travel speed estimation
- Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning
- Equitable routing of rail hazardous materials shipments using CVaR methodology
- A model for tonal progressions of seventh chords
- Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account
- \(k\)-best solutions of MSO problems on tree-decomposable graphs
- Computing and listing \(st\)-paths in public transportation networks
- Methods for determining cycles of a specific length in undirected graphs with edge weights
- Ein neuer Algorithmus zur Bestimmung von k-kürzesten Wegen in einem Graphen
- Fracture network flow prediction with uncertainty using physics-informed graph features
- Finding outbreak trees in networks with limited information
- Ein leistungsfähiger Algorithmus zur Bestimmung von K-kürzesten Wegen in einem Graphen
- Simultaneous location and vehicle fleet sizing of relief goods distribution centers and vehicle routing for post-disaster logistics
- Allowable processing orders in the accelerated cascade algorithm
- Ein Verfahren zur Alternativroutensuche in Verkehrsnetzen
- An algorithm for ranking paths in acyclic networks
- Targeted and contextual redescription set exploration
- Evaluation and enumeration problems for regular path queries
- Multiple train repositioning operations in a railyard network
- Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints
- Computing cyclic invariants for molecular graphs
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)
