Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
From MaRDI portal
Publication:4173214
DOI10.1287/opre.27.1.161zbMath0391.90089OpenAlexW2069916913MaRDI QIDQ4173214
Bennett L. Fox, Eric V. Denardo
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.27.1.161
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05)
Related Items
A branch-and-price approach for a multi-period vehicle routing problem ⋮ A computational study of efficient shortest path algorithms ⋮ On Some Special Network Flow Problems: The Shortest Path Tour Problems ⋮ Shortest paths algorithms: Theory and experimental evaluation ⋮ Multiobjective routing problems ⋮ A reoptimization algorithm for the shortest path problem with time windows ⋮ Unnamed Item ⋮ Sharing information for the all pairs shortest path problem ⋮ A novel pseudo‐polynomial approach for shortest path problems ⋮ An O(m log D) algorithm for shortest paths ⋮ An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance ⋮ Heuristics and their design: A survey ⋮ Generalized dynamic programming for multicriteria optimization ⋮ A new algorithm for reoptimizing shortest paths when the arc costs change ⋮ Order preserving extendible hashing and bucket tries ⋮ A new algorithm to find the shortest paths between all pairs of nodes ⋮ The orienteering problem with stochastic travel and service times ⋮ Shortest path algorithms: A computational study with the C programming language ⋮ Routing with nonlinear multiattribute cost functions ⋮ Single machine scheduling with flow time and earliness penalties ⋮ Complexity analysis and optimization of the shortest path tour problem ⋮ Algebraic Theory on Shortest Paths for All Flows ⋮ Efficient modeling of travel in networks with time-varying link speeds ⋮ Integer priority queues with decrease key in constant time and the single source shortest paths problem ⋮ A hybrid approach to discrete mathematical programming ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ A Reach and Bound algorithm for acyclic dynamic-programming networks ⋮ An algorithm for ranking paths that may contain cycles ⋮ An extension of labeling techniques for finding shortest path trees ⋮ A NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKS ⋮ Dynamic programming using the Fritz-John conditions ⋮ DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS ⋮ On a special class of bicriterion path problems ⋮ Regarding Goal Bounding and Jump Point Search ⋮ Alternative group relaxation of integer programming problems ⋮ Shortest paths in networks with vector weights ⋮ A dynamic programming algorithm for multiple-choice constraints ⋮ An algorithm for the ranking of shortest paths ⋮ Microcomputer-based algorithms for large scale shortest path problems ⋮ The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets