Finding the K Shortest Loopless Paths in a Network

DOI10.1287/MNSC.17.11.712zbMATH Open0218.90063OpenAlexW2011282943WikidataQ57253945 ScholiaQ57253945MaRDI QIDQ5623536FDOQ5623536

Author name not available (Why is that?)

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (only showing first 100 items - show all)

• K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
• Finding \(K\) shortest looping paths with waiting time in a time--window network
• Solving the \(k\)-shortest path problem with time windows in a time varying network
• Finding shortest and dissimilar paths
• Implementation of algorithms forK shortest loopless paths
• Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
• \(k\)-shortest routing of trains on shunting yards
• A bicriterion approach for routing problems in multimedia networks
• New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
• Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
• The minmax regret robust shortest path problem in a finite multi-scenario model
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
• Multi-commodity distribution under uncertainty in disaster response phase: model, solution method, and an empirical study
• An algorithm for the resource constrained shortest path problem
• Routing of a hazmat truck in the presence of weather systems
• Fast computation of bounds for two-terminal network reliability
• Algorithms for the quickest path problem and the reliable quickest path problem
• Regenerator Location Problem in Flexible Optical Networks
• Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
• ATM VP-based network design
• An efficient time and space \(K\) point-to-point shortest simple paths algorithm
• The \(k\)-dissimilar vehicle routing problem
• Finding minimum and equitable risk routes for hazmat shipments
• Finding theKth shortest path in a time-schedule network
• A new implementation of Yen's ranking loopless paths algorithm
• The equity constrained shortest path problem
• 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
• A route set construction algorithm for the transit network design problem
• On the \(K\) shortest path trees problem
• How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• A Catalog of Formulations for the Network Pricing Problem
• Integrated approach to network design and frequency setting problem in railway rapid transit systems
• Multiple-path selection for new highway alignments using discrete algorithms
• Finding the Minimum-Weight k-Path
• Generalized route planning model for hazardous material transportation with VaR and equity considerations
• An algorithm for finding the \(k\) quickest paths in a network
• An algorithm for the ranking of shortest paths
• An exact algorithm for the network pricing problem
• Finding the \(k\) quickest simple paths in a network
• Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
• Multiobjective routing problems
• Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
• Finding next-to-shortest paths in a graph
• Assessing the reliability and the expected performance of a network under disaster risk
• An algorithm for ranking quickest simple paths
• Finding the k Shortest Paths
• A parametric approach to solving bicriterion shortest path problems
• Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
• Optimization and probabilistic satisfiability on nested and co-nested formulas
• A k shortest path algorithm for adaptive routing in communications networks
• An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
• A network-based model for transporting extremely hazardous materials
• A comprehensive survey on the quickest path problem
• On finding dissimilar paths
• Finding the \(K\) shortest hyperpaths
• Finding the first \(K\) shortest paths in a time-window network.
• On discrete optimization with ordering
• Ranking paths in stochastic time-dependent networks
• A penalty function heuristic for the resource constrained shortest path problem
• Object modeling and path computation for multimodal travel systems
• A multiobjective evolutionary algorithm based on decomposition with normal boundary intersection for traffic grooming in optical networks
• An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
• Finding \(K\) shortest looping paths in a traffic-light network
• Path assignment for call routing: An application of tabu search
• Title not available (Why is that?)
• Effective Algorithms for a Class of Discrete Valued Optimal Control Problems
• Optimal shortest path set problem in undirected graphs
• Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
• Unified approach to fuzzy graph problems
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
• 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 the shortest path problem with negative cost cycles
• An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem
• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
• Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
• An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
• Finding the K mean-standard deviation shortest paths under travel time uncertainty
• 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
• Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
• Computing and Listing st-Paths in Public Transportation Networks
• Vertex labeling and routing for Farey-type symmetrically-structured graphs
• A bi-objective decision model and method for the integrated optimization of bus line planning and Lane reservation
• A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
• Ein Verfahren zur Alternativroutensuche in Verkehrsnetzen
• Candidate sets for alternative routes in road networks
• Generating price-effective intermodal routes
• Improving scheduling in multi-AGV systems by task prediction
• Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
• Algorithm for solving K-shortest paths problem in complicated network
• Voronoi diagrams with barriers and on polyhedra for minimal path planning
• Transducing Markov sequences
• Low time complexity algorithms for path computation in Cayley graphs
• Title not available (Why is that?)
• Traffic graph convolutional network for dynamic urban travel speed estimation
• An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
• Multiobjective swarm intelligence for the traffic grooming problem

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)