Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees

@article{Alizadeh2011CombinatorialAF,
  title={Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees},
  author={Behrooz Alizadeh and Rainer E. Burkard},
  journal={Networks},
  year={2011},
  volume={58},
  pages={190-200}
}
In an inverse network absolute (or vertex) 1-center location problem the parameters of a given network, like edge lengths or vertex weights, have to be modified at minimum total cost such that a prespecified vertex s becomes an absolute (or a vertex) 1-center of the network. In this article, the inverse absolute and vertex 1-center location problem on trees with n + 1 vertices is considered where the edge lengths can be changed within certain bounds. For solving these problems a fast method is… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Minimax location of a facility in an undirected tree graph

  • G. Y. Handler
  • Transportation Science 7
  • 1973
Highly Influential
5 Excerpts

Inverse 1-Median Problems

  • M. Galavii
  • Ph.D. Thesis, Institute of Optimization and…
  • 2008
Highly Influential
4 Excerpts

Facility Location

  • Z. Drezner, H. W. Hamacher
  • Applications and Theory, Springer Verlag, Berlin
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…