Complexity of some inverse shortest path lengths problems

The input to an inverse shortest path lengths problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not necessarily conform to the shortest path lengths in G. The goal is to modify the arc weights, subject to a penalty on the deviation from the given weights, so that the shortest path lengths are equal to the prescribed values. We show that although ISPL is an NP-hard problem, several ISPL classes are polynomially solvable. These cases include ISPL where the collection of the pairs share a single source and all other nodes as destinations (the single-source all-sink problem SAISPL). For the case where the collection contains a single node pair (the single-source single-sink problem SSISPL), we identify conditions on the uniformity of the penalty functions and on the original arc weights, which make SSISPL polynomially solvable. These results cannot be strengthened significantly as the general single-source ISPL is NP-hard and the all-sink case, with more than one source, is also NP-hard. We further provide a convex programming formulation for a relaxation of ISPL in which the shortest path lengths are only required to be no less than the given values (LBISPL). It is demonstrated how this compact formulation leads to efficient algorithms for ISPL. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010

[1]  Robert E. Tarjan,et al.  Finding optimum branchings , 1977, Networks.

[2]  Cheng-Huang Hung.  On the inverse shortest path length problem , 2003 .

[3]  Kenneth O. Kortanek,et al.  A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems , 1993, Math. Oper. Res..

[4]  Ravindra K. Ahuja,et al.  Solving Inverse Spanning Tree Problems Through Network Flow Techniques , 1999, Oper. Res..

[5]  Ravindra K. Ahuja,et al.  A Faster Algorithm for the Inverse Spanning Tree Problem , 2000, J. Algorithms.

[6]  Yanjun Li,et al.  Inverse Matroid Intersection Problem , 1997, Math. Methods Oper. Res..

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

[8]  Mao-cheng Cai,et al.  A Network Improvement Problem Under Different Norms , 2004, Comput. Optim. Appl..

[9]  Yongpei Guan,et al.  The inverse optimal value problem , 2005, Math. Program..

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

[11]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[12]  Yinyu Ye,et al.  Interior point algorithms: theory and analysis , 1997 .

[13]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

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

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

[16]  Zhenhong Liu,et al.  Some reverse location problems , 2000, Eur. J. Oper. Res..

[17]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

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

[19]  Chao Yang,et al.  A column generation method for inverse shortest path problems , 1995, Math. Methods Oper. Res..

[20]  Dorit S. Hochbaum,et al.  Efficient Algorithms for the Inverse Spanning-Tree Problem , 2003, Oper. Res..

[21]  Mao-cheng Cai,et al.  Inapproximability and a polynomially solvable special case of a network improvement problem , 2004, Eur. J. Oper. Res..

[22]  Zhenhong Liu,et al.  On Inverse Problems of Optimum Perfect Matching , 2003, J. Comb. Optim..

[23]  Mao-cheng Cai,et al.  The Complexity Analysis of the Inverse Center Location Problem , 1999, J. Glob. Optim..