Capacity Inverse Minimum Cost Flow Problem
- Given a directed graph G = (N,A) with arc capacities u and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector u' for the arc set A such that a given feasible flow x' is optimal with respect to the modified capacities. Among all capacity vectors u' satisfying this condition, we would like to find one with minimum ||u' - u|| value. We consider two distance measures for ||u' - u||, rectilinear and Chebyshev distances. By reduction from the feedback arc set problem we show that the capacity inverse minimum cost flow problem is NP-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.
Verfasser*innenangaben: | Cigdem Güler, Horst Hamacher |
---|---|
URN: | urn:nbn:de:hbz:386-kluedo-15097 |
Schriftenreihe (Bandnummer): | Report in Wirtschaftsmathematik (WIMA Report) (111) |
Dokumentart: | Preprint |
Sprache der Veröffentlichung: | Englisch |
Jahr der Fertigstellung: | 2007 |
Jahr der Erstveröffentlichung: | 2007 |
Veröffentlichende Institution: | Technische Universität Kaiserslautern |
Datum der Publikation (Server): | 03.12.2007 |
Freies Schlagwort / Tag: | inverse problems; minimum cost flows; network flows |
Fachbereiche / Organisatorische Einheiten: | Kaiserslautern - Fachbereich Mathematik |
DDC-Sachgruppen: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
Lizenz (Deutsch): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |