An algorithm to determine a path with minimal cost/capacity ratio

Abstract

Let G(N, A) be a finite directed network where N= { 1, . . . , n} is the set of nodes and A c ((i, j) 1 i#j and i, je N) is the set of arcs. Each arc (i j) E A is assigned a cost cjj and a capacity k;j. In what follows we do assume that c,, and k,, are positive integers. Let s and t be two given and distinguished nodes of G(N, A). A path p from s to t in G… (More)
DOI: 10.1016/0166-218X(84)90100-8

Topics

1 Figure or Table

Cite this paper

@article{Martins1984AnAT, title={An algorithm to determine a path with minimal cost/capacity ratio}, author={Ernesto de Queir{\'o}s Vieira Martins}, journal={Discrete Applied Mathematics}, year={1984}, volume={8}, pages={189-194} }