Advertisement

Inverse 1-median Problem on Trees under Weighted l ∞  Norm

  • Xiucui Guan
  • Binwu Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6124)

Abstract

The inverse 1-median problem is concerned with modifying the weights of the customers at minimum cost such that a prespecified supplier becomes the 1-median of modified location problem. We first present the model of inverse 1-median problem on trees. Then we propose two algorithms to solve the problem under weighted l  ∞  norm with bound constraints on modifications. Based on the approach of the unbounded case, we devise a greedy-type algorithm which runs in O(n 2) time, where n is the number of vertices. Based on the property of the optimal solution, we propose an O(n logn) time algorithm using the binary search.

Keywords

Inverse 1-median problem Tree weighted l ∞  norm Binary search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alizadeh, B., Burkard, R.E.: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Technical Report, Graz University of Technology (2009), http://www.math.tugraz.at/fosp/pdfs/tugraz_0143.pdf
  2. 2.
    Alizadeh, B., Burkard, R.E., Pferschy, U.: Inverse 1-center location problems with edge length augmentation on trees. Computing 86(4), 331–343 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Operations Research 28, 1130–1154 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Bonab, F.B., Burkard, R.E., Alizadeh, B.: Inverse Median Location Problems with Variable Coordinates. Central European Journal of Operations Research (2009), doi:10.1007/s10100-009-0114-2Google Scholar
  5. 5.
    Burkard, R.E., Galavii, M., Gassner, E.: The inverse Fermat-Weber problem. Technical Report, Graz University of Technology (2008), http://www.math.tugraz.at/fosp/pdfs/tugraz_0107.pdf
  6. 6.
    Burkard, R.E., Pleschiutschnig, C., Zhang, J.: Inverse median problems. Discrete Optimization 1, 23–39 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Burkard, R.E., Pleschiutschnig, C., Zhang, J.Z.: The inverse 1- median problem on a cycle. Discrete Optimization 5, 242–253 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Cai, M., Yang, X., Zhang, J.: The complexity analysis of the inverse center location problem. J. Global Optim. 5, 213–218 (1999)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Galavii, M.: Inverse 1-Median Problems, Ph.D. Thesis, Institute of Optimization and Discrete Mathematics, Graz University of Technology, Graz, Austria (2008)Google Scholar
  10. 10.
    Gassner, E.: The inverse 1-maxian problem with edge length modiffication. Journal of Combinatorial Optimization 16, 50–67 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Gassner, E.: A game-theoretic approach for downgrading the 1-median in the plane with manhattan metric. Ann. Oper. Res. 172(1), 393–404 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Goldman, A.J.: Optimal center location in simple networks. Transportation Science 2, 77–91 (1962)Google Scholar
  13. 13.
    Hua, et al.: Applications of mathematical models to wheat harvesting. Acta Mathematica Sinica 11, 63–75 (1961) (in Chinese); English Translation in Chinese Math. 2, 77–91 (1962)Google Scholar
  14. 14.
    Yang, X., Zhang, J.: Inverse center location problem on a tree. Journal of Systems Science and Complexity 21, 651–664 (2008)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Xiucui Guan
    • 1
  • Binwu Zhang
    • 2
  1. 1.Department of MathematicsSoutheast UniversityNanjingChina
  2. 2.Department of Mathematics and PhysicsHohai UniversityChangzhouChina

Personalised recommendations