Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
From MaRDI portal
Publication:4173214
DOI10.1287/opre.27.1.161zbMath0391.90089MaRDI QIDQ4173214
Eric V. Denardo, Bennett L. Fox
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
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
65K05: Numerical mathematical programming methods
Related Items
Unnamed Item, Integer priority queues with decrease key in constant time and the single source shortest paths problem, Routing with nonlinear multiattribute cost functions, Single machine scheduling with flow time and earliness penalties, An algorithm for ranking paths that may contain cycles, On a special class of bicriterion path problems, Alternative group relaxation of integer programming problems, Shortest paths in networks with vector weights, A dynamic programming algorithm for multiple-choice constraints, Generalized dynamic programming for multicriteria optimization, Microcomputer-based algorithms for large scale shortest path problems, A computational study of efficient shortest path algorithms, A reoptimization algorithm for the shortest path problem with time windows, An O(m log D) algorithm for shortest paths, Heuristics and their design: A survey, Order preserving extendible hashing and bucket tries, A new algorithm to find the shortest paths between all pairs of nodes, Shortest path algorithms: A computational study with the C programming language, An algorithm for the ranking of shortest paths, A new algorithm for reoptimizing shortest paths when the arc costs change, Dynamic programming using the Fritz-John conditions, Shortest paths algorithms: Theory and experimental evaluation, Multiobjective routing problems, The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets, A hybrid approach to discrete mathematical programming
