Abstract
Given a linear cost function for lengthening arcs, a technique is shown for maximizing, within a budget, the shortest source—sink path length in a graph. The computation is equivalent to the parametric solution of a minimum cost flow problem.
This is a preview of subscription content, log in via an institution to check access.
References
C. Berge,Graphs and hypergraphs (North-Holland, Amsterdam, 1973).
R.G. Bland, “Complementary orthogonal subspaces ofR n and orientability of matroids,” Department of Operations Research, Cornell University, Tech. Rept. No. 219.
L.R. Ford, Jr. and D.R. Fulkerson.Flows in networks (Princeton Press, 1962).
D.R. Fulkerson, “Increasing the capacity of a network: the parametric budget problem”,Management Science 5 (1959) 472–483.
D.R. Fulkerson, “Networks, frames and blocking systems”, in: G.B. Dantzig and A.F. Veinott, Jr., Eds.,Mathematics of the decision sciences, Lecture in applied mathematics, Vol. II (Am. Math. Soc., 1968) pp. 303–334.
G.C. Harding, “Some budgeted optimization problems and the edge disjoint branchings problem,” Dissertation, Cornell University (1977).
Author information
Authors and Affiliations
Additional information
This work was done while G.C. Harding was at Cornell University.
The work of D.R. Fulkerson was supported by the National Science Foundation under Grant MPS74-24026 and by the Office of Naval Research under Grant NR 044-439.
Rights and permissions
About this article
Cite this article
Fulkerson, D.R., Harding, G.C. Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming 13, 116–118 (1977). https://doi.org/10.1007/BF01584329
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584329