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




Related Items

A branch-and-price approach for a multi-period vehicle routing problemA computational study of efficient shortest path algorithmsOn Some Special Network Flow Problems: The Shortest Path Tour ProblemsShortest paths algorithms: Theory and experimental evaluationMultiobjective routing problemsA reoptimization algorithm for the shortest path problem with time windowsUnnamed ItemSharing information for the all pairs shortest path problemA novel pseudo‐polynomial approach for shortest path problemsAn O(m log D) algorithm for shortest pathsAn accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distanceHeuristics and their design: A surveyGeneralized dynamic programming for multicriteria optimizationA new algorithm for reoptimizing shortest paths when the arc costs changeOrder preserving extendible hashing and bucket triesA new algorithm to find the shortest paths between all pairs of nodesThe orienteering problem with stochastic travel and service timesShortest path algorithms: A computational study with the C programming languageRouting with nonlinear multiattribute cost functionsSingle machine scheduling with flow time and earliness penaltiesComplexity analysis and optimization of the shortest path tour problemAlgebraic Theory on Shortest Paths for All FlowsEfficient modeling of travel in networks with time-varying link speedsInteger priority queues with decrease key in constant time and the single source shortest paths problemA hybrid approach to discrete mathematical programmingA survey of resource constrained shortest path problems: Exact solution approachesA Reach and Bound algorithm for acyclic dynamic-programming networksAn algorithm for ranking paths that may contain cyclesAn extension of labeling techniques for finding shortest path treesA NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKSDynamic programming using the Fritz-John conditionsDEVIATION ALGORITHMS FOR RANKING SHORTEST PATHSOn a special class of bicriterion path problemsRegarding Goal Bounding and Jump Point SearchAlternative group relaxation of integer programming problemsShortest paths in networks with vector weightsA dynamic programming algorithm for multiple-choice constraintsAn algorithm for the ranking of shortest pathsMicrocomputer-based algorithms for large scale shortest path problemsThe Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets