Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

1 February 1979

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 27 (1) , 161-186
https://doi.org/10.1287/opre.27.1.161

Abstract

We present a new family of shortest-route methods, which reduce an upper bound on running time, and make empirical comparisons for a certain class of networks. These methods also allow for exploitation of structure by pruning arcs and/or nodes.

Keywords

STRUCTURE
ROUTE METHODS
PRUNING
NODES
ARCS
BUCKETS WE PRESENT
SHORTEST ROUTE
REACHING

This publication has 0 references indexed in Scilit: