Capacity inverse minimum cost flow problem

AbstractGiven a directed graph G=(N,A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector $\hat{u}$ for the arc set A such that a given feasible flow $\hat{x}$ is optimal with respect to the modified capacities. Among all capacity vectors $\hat{u}$ satisfying this condition, we would like to find one with minimum $\|\hat{u}-u\|$ value.We consider two distance measures for $\|\hat{u}-u\|$ , rectilinear (L1) and Chebyshev (L∞) distances. By reduction from the feedback arc set problem we show that the capacity inverse minimum cost flow problem is $\mathcal{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.

[1]  Camil Demetrescu,et al.  Combinatorial algorithms for feedback problems in directed graphs , 2003, Inf. Process. Lett..

[2]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[3]  Zhenhong Liu,et al.  A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l∞ Norm , 2002, J. Comb. Optim..

[4]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[5]  Longcheng Liu,et al.  Inverse maximum flow problems under the weighted Hamming distance , 2006, J. Comb. Optim..

[6]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[7]  Liqun Qi,et al.  The shortest path improvement problems under Hamming distance , 2006, J. Comb. Optim..

[8]  Clemens Heuberger,et al.  Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results , 2004, J. Comb. Optim..

[9]  Ravindra K. Ahuja,et al.  Combinatorial algorithms for inverse network flow problems , 2002, Networks.

[10]  Ravindra K. Ahuja,et al.  Inverse Optimization , 2001, Oper. Res..

[11]  Youssef Saab,et al.  A Fast and Effective Algorithm for the Feedback Arc Set Problem , 2001, J. Heuristics.

[12]  Jim Law,et al.  Review of "The boost graph library: user guide and reference manual by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine." Addison-Wesley 2002. , 2003, SOEN.

[13]  Jianzhon Zhang,et al.  Calculating some inverse linear programming problems , 1996 .

[14]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[15]  Donald Goldfarb,et al.  A computational comparison of the dinic and network simplex methods for maximum flow , 1988 .

[16]  Philippe L. Toint,et al.  On an instance of the inverse shortest paths problem , 1992, Math. Program..

[17]  Jeremy G. Siek,et al.  The Boost Graph Library - User Guide and Reference Manual , 2001, C++ in-depth series.

[18]  R. Burkard,et al.  Minimal cost flows in regular matroids , 1981 .

[19]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[20]  Horst W. Hamacher,et al.  Inverse Radiation Therapy Planning: A Multiple Objective Optimisation Approach , 1999 .

[21]  Philippe L. Toint,et al.  On the use of an inverse shortest paths algorithm for recovering linearly correlated costs , 1994, Math. Program..

[22]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Jianzhon Zhang,et al.  Inverse maximum flow and minimum cut problems , 1997 .