Finding the K Shortest Loopless Paths in a Network
From MaRDI portal
Publication:5623536
DOI10.1287/mnsc.17.11.712zbMath0218.90063OpenAlexW2011282943WikidataQ57253945 ScholiaQ57253945MaRDI QIDQ5623536
No author found.
Publication date: 1971
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.17.11.712
Related Items (only showing first 100 items - show all)
Finding outbreak trees in networks with limited information ⋮ Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ The minmax regret robust shortest path problem in a finite multi-scenario model ⋮ 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 ⋮ An algorithm for ranking quickest simple paths ⋮ Finding \(K\) shortest looping paths in a traffic-light network ⋮ Fast computation of bounds for two-terminal network reliability ⋮ Graceful reassignment of excessively long communications paths in networks ⋮ Targeted and contextual redescription set exploration ⋮ Optimal deployment of alternative fueling stations on transportation networks considering deviation paths ⋮ \(k\)-shortest routing of trains on shunting yards ⋮ Computing and listing \(st\)-paths in public transportation networks ⋮ A comprehensive survey on the quickest path problem ⋮ An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks ⋮ The \(k\)-dissimilar vehicle routing problem ⋮ Multiple-path selection for new highway alignments using discrete algorithms ⋮ Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation ⋮ Finding minimum and equitable risk routes for hazmat shipments ⋮ Routing of a hazmat truck in the presence of weather systems ⋮ 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 ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ A bi-objective decision model and method for the integrated optimization of bus line planning and Lane reservation ⋮ Integrated approach to network design and frequency setting problem in railway rapid transit systems ⋮ Multi-commodity distribution under uncertainty in disaster response phase: model, solution method, and an empirical study ⋮ Congestion avoiding heuristic path generation for the proactive route guidance ⋮ ATM VP-based network design ⋮ On discrete optimization with ordering ⋮ Multiobjective routing problems ⋮ Algorithms for the quickest path problem and the reliable quickest path problem ⋮ Path planning for robotic teams based on LTL specifications and Petri net models ⋮ On the online multi-agent O-D \(k\)-Canadian traveler problem ⋮ Enumerating \(K\) best paths in length order in DAGs ⋮ Understanding the complexity of axiom pinpointing in lightweight description logics ⋮ Ranking robustness and its application to evacuation planning ⋮ Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks ⋮ How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis ⋮ Ein leistungsfähiger Algorithmus zur Bestimmung von K-kürzesten Wegen in einem Graphen ⋮ Delay resistant line planning with a view towards passenger transfers ⋮ Physics-informed machine learning for backbone identification in discrete fracture networks ⋮ K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths ⋮ An exact algorithm for the network pricing problem ⋮ Object modeling and path computation for multimodal travel systems ⋮ Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs ⋮ The equity constrained shortest path problem ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ Optimization and probabilistic satisfiability on nested and co-nested formulas ⋮ Assessing the reliability and the expected performance of a network under disaster risk ⋮ A study of network violator interception based on a reliable game model ⋮ Finding the first \(K\) shortest paths in a time-window network. ⋮ Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm ⋮ On finding dissimilar paths ⋮ 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 ⋮ A multiobjective evolutionary algorithm based on decomposition with normal boundary intersection for traffic grooming in optical networks ⋮ 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 ⋮ An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs ⋮ An algorithm for finding the \(k\) quickest paths in a network ⋮ Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation ⋮ Finding the \(K\) shortest paths in a schedule-based transit network ⋮ Finding the \(K\) shortest hyperpaths ⋮ The first \(K\) shortest unique-arc walks in a traffic-light network ⋮ An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs ⋮ Ein neuer Algorithmus zur Bestimmung von k-kürzesten Wegen in einem Graphen ⋮ Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction ⋮ Finding \(K\) shortest looping paths with waiting time in a time--window network ⋮ The multiple shortest path problem with path deconfliction ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ Ranking paths in stochastic time-dependent networks ⋮ Combination of piecewise-geodesic paths for interactive segmentation ⋮ Solving the \(k\)-shortest path problem with time windows in a time varying network ⋮ Ein Verfahren zur Alternativroutensuche in Verkehrsnetzen ⋮ A route set construction algorithm for the transit network design problem ⋮ Combinatorial optimization algorithms for detecting collapse mechanisms of concrete slabs ⋮ Efficient single-pair all-shortest-path query processing for massive dynamic networks ⋮ 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 ⋮ 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 ⋮ Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints ⋮ Multiple train repositioning operations in a railyard network ⋮ Neural and delay based heuristics for the Steiner problem in networks ⋮ Heuristics for the stochastic/dynamic user-optimal route choice problem ⋮ Vertex labeling and routing for Farey-type symmetrically-structured graphs ⋮ An algorithm for ranking paths in acyclic networks ⋮ A penalty function heuristic for the resource constrained shortest path problem ⋮ Multiobjective swarm intelligence for the traffic grooming problem ⋮ An algorithm for the ranking of shortest paths ⋮ Optimal shortest path set problem in undirected graphs ⋮ Optimal flow and capacity allocation in multiple joint quickest paths of directed networks ⋮ Unified approach to fuzzy graph problems ⋮ A parametric approach to solving bicriterion shortest path problems ⋮ Finding the \(k\) quickest simple paths in a network ⋮ Allowable processing orders in the accelerated cascade algorithm ⋮ Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
This page was built for publication: Finding the K Shortest Loopless Paths in a Network
