Inverse Spanning Tree Problems: Formulations and Algorithms
Year: 2011
Type: report
Abstract: Given a solution x* and an a priori estimated cost vector c, the inverse optimization problem is to identify another cost vector d so that x* is optimal with respect to the cost vector d and the deviation of d from c is minimum.In this paper, we consider the inverse spanning tree problem on an undirected graph G = (N, A) with n nodes and m arcs, and where the deviation between c and d is defined by the rectilinear distance between the two vectors (that is, L, norm).We show that the inverse spanning tree problem can be formulated as the dual of an assignment problem on a bipartite network G = (N , A ) with N° = N^u N^and A° c N^x N^.The bipartite network satisfies the property that IN^l = (n -1), IN^I = (m -n + 1), and lA I = 0(nm).In general, IN I < < IN I. Using this special structure of the assignment problem, we develop a specific implementation of the successive shortest path algorithm that solves the inverse spanning tree problem in 0(n ) time.We also consider the weighted version of the inverse spanning tree problem where we minimize the sum of the weighted deviations of arcs and show that it can be formulated as the dual of the transportation problem.Using a cost scaling algorithm, the transportationproblem can be solved in 0(n m iog(nC)), where C denotes the largest arc cost in the data.Finally, we consider a minimax version of the inverse spanning tree problem and show that it can be solved in 0(n ) time.
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Office of Naval Research
OpenAlex ID: W2125035701
