ISSN:
1436-4646
Keywords:
Network flows
;
Network interdiction
;
Minimum paths
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01584329
Permalink