Name
Abstract | ||
|---|---|---|
Given a directed graph G=(N,A) with arc capacities u
ij
and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector
for the arc set A such that a given feasible flow
is optimal with respect to the modified capacities. Among all capacity vectors
satisfying this condition, we would like to find one with minimum
value.
We consider two distance measures for
, rectilinear (L
1) and Chebyshev (L
∞) distances. By reduction from the feedback arc set problem we show that the capacity inverse minimum cost flow problem is
-hard in the rectilinear case. On the other hand, it is polynomially solvable by a greedy algorithm for the Chebyshev norm.
In the latter case we propose a heuristic for the bicriteria problem, where we minimize among all optimal solutions the number
of affected arcs. We also present computational results for this heuristic. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s10878-008-9159-8 | Journal of Combinatorial Optimization |
Keywords | DocType | Volume |
Inverse problems,Network flows,Minimum cost flows | Journal | 19 |
Issue | ISSN | Citations |
1 | 1382-6905 | 6 |
PageRank | References | Authors |
0.49 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Çigdem Güler | 1 | 39 | 2.44 |
| Horst W. Hamacher | 2 | 562 | 57.39 |