An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions

Ali Reza Sepasian, Freydoon Rahbarnia

Optimization · 2013 · 23 citations · 10 references

Concepts

Abstract

AbstractWe investigate the inverse 1-median problem on trees where it is possible to change the weights of vertices or to reduce the length of an edge to zero. An algorithm is designed for solving this problem in case of symmetric bounds on the vertex weights.Keywords: inverse optimizationfacility location1-median problemAMS Subject Classifications: 90B1090B8090C05 AcknowledgmentsThe authors would like to greatfully acknowledge the influence of the seminal work of Professor Rainer Burkard, in particular a talk he presented at our institute, which inspired us to work on this problem. We are also very grateful for the remarks and revisions suggested by an anonymous referee which led to a major improvement of the original paper.

References

10