- The partial inverse minimum spanning tree problem when weight increase is forbidden
- European Journal of Operational Research
- Volume | Issue number
- 188 | 2
- Pages (from-to)
- Number of pages
- Document type
- Faculty of Economics and Business (FEB)
- Amsterdam School of Economics Research Institute (ASE-RI)
In a partial inverse optimization problem there is an underlying optimization problem with a partially given solution. The objective is to find a minimal perturbation of some of the problem’s parameter values, in such a way that the partial solution becomes a part of the optimal solution.
We consider the partial inverse minimum spanning tree problem in an undirected weighted graph under the constraint that edge weights can not be increased: by decreasing one or more edge weights as little as possible, a given forest must be presented in the new minimum spanning tree. Under a quite general criterion function, evaluating the proposed decreases of weight, we show that this problem can be solved in polynomial time.
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.