We consider the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a given node to all other nodes in a network of n nodes or finding a ...
This is a preview. Log in through your library . Abstract We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback