Microcomputer-based algorithms for large scale shortest path problems
From MaRDI portal
Publication:1072451
DOI10.1016/0166-218X(86)90081-8zbMath0586.90086MaRDI QIDQ1072451
Darwin D. Klingman, Robert F. Schneider
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
implementationmicrocomputercomputational testingthreshold-based in- core/out-of-core shortest path algorithm
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Paths and cycles (05C38)
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- Evaluation and optimization of urban public transportation networks
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- An evaluation of mathematical programming and minicomputers
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- On a routing problem
- A New Polynomially Bounded Shortest Path Algorithm
- Threshold assignment algorithm
- New Polynomial Shortest Path Algorithms and Their Computational Attributes
- Solving the Assignment Problem by Relaxation
- An Investment Staging Model for a Bridge Replacement Problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Properties of Labeling Methods for Determining Shortest Path Trees
- A shortest augmenting path method for solving minimal perfect matching problems
- Optimal Network Capacity Planning: A Shortest-Path Scheme
- A branch and bound algorithm for the generalized assignment problem
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- Shortest path algorithms for knapsack type problems
- Production Smoothing Under Piecewise Concave Costs, Capacity Constraints and Nondecreasing Requirements
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- Implementation and efficiency of Moore-algorithms for the shortest route problem
- Flow Networks and Combinatorial Operations Research
This page was built for publication: Microcomputer-based algorithms for large scale shortest path problems
