Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

The inverse maximum flow problem considering norm

Adrian Deaconu — 2008

RAIRO - Operations Research

The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast ⋅log()) time complexity algorithm for solving this problem is presented, where is the number of arcs and is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The algorithm proposed...

Page 1

Download Results (CSV)