Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 313868, 6 pages
http://dx.doi.org/10.1155/2013/313868
Research Article

The Inverse 1-Median Problem on Tree Networks with Variable Real Edge Lengths

1College of Science, China Jiliang University, Hangzhou 310018, China
2Division of Computer Science and Engineering, Chonbuk National University, Jeonju, Jeonbuk 561-756, Republic of Korea
3College of Computer Science, Zhejiang University of Technology, Hangzhou 310023, China

Received 25 January 2013; Accepted 22 March 2013

Academic Editor: Carlo Cattani

Copyright © 2013 Longshu Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. O. Kariv and S. L. Hakimi, “An algorithmic approach to network location problems. II. The p-medians,” SIAM Journal on Applied Mathematics, vol. 37, no. 3, pp. 539–560, 1979. View at Publisher · View at Google Scholar · View at MathSciNet
  2. L. K. Hua, “Applications of mathematical models to wheat harvesting,” Chinese Mathematics, no. 2, pp. 77–91, 1962. View at Google Scholar
  3. A. J. Goldman, “Optimal center location in simple networks,” Transportation Science, no. 5, pp. 212–221, 1971. View at Google Scholar · View at MathSciNet
  4. H. Shi, W. Wang, N. M. Kwok, and S. Y. Chen, “Game theory for wireless sensor networks: a survey,” Sensors, vol. 12, no. 7, pp. 9055–9097, 2012. View at Google Scholar
  5. O. Berman and J. Wang, “The network p-median problem with discrete probabilistic demand weights,” Computers & Operations Research, vol. 37, no. 8, pp. 1455–1463, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  6. M. Chrobak, C. Kenyon, J. Noga, and N. E. Young, “Incremental medians via online bidding,” Algorithmica, vol. 50, no. 4, pp. 455–478, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. R. Tadei, N. Ricciardi, and G. Perboli, “The stochastic p-median problem with unknown cost probability distribution,” Operations Research Letters, vol. 37, no. 2, pp. 135–141, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  8. S. Chen, Y. Zheng, C. Cattani, and W. Wang, “Modeling of biological intelligence for SCM system optimization,” Computational and Mathematical Methods in Medicine, vol. 2012, Article ID 769702, 10 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. R. E. Burkard, C. Pleschiutschnig, and J. Zhang, “Inverse median problems,” Discrete Optimization, vol. 1, no. 1, pp. 23–39, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. R. E. Burkard, C. Pleschiutschnig, and J. Z. Zhang, “The inverse 1-median problem on a cycle,” Discrete Optimization, vol. 5, no. 2, pp. 242–253, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. R. E. Burkard, M. Galavii, and E. Gassner, “The inverse Fermat-Weber problem,” Technical Report 2008-14, Graz University of Technology, Graz, Austria, 2008. View at Google Scholar
  12. M. Galavii, “The inverse 1-median problem on a tree and on a path,” Electronic Notes in Discrete Mathematics, no. 36, pp. 1241–1248, 2010. View at Google Scholar
  13. X. C. Guan and B. W. Zhang, “Inverse 1-median problem on trees under weighted Hamming distance,” Journal of Global Optimization, vol. 54, no. 1, pp. 75–82, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  14. F. B. Bonab, R. E. Burkard, and E. Gassner, “Inverse p-median problems with variable edge lengths,” Mathematical Methods of Operations Research, vol. 73, no. 2, pp. 263–280, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  15. R. Diestel, Graph Theory, Springer, Heidelberg, Germany, 3rd edition, 2005. View at MathSciNet
  16. J. Z. Zhang and Y. X. Lin, “Computation of the reverse shortest-path problem,” Journal of Global Optimization, vol. 25, no. 3, pp. 243–261, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. J. Z. Zhang, X. G. Yang, and M. C. Cai, “Inapproximability and a polynomially solvable special case of a network improvement problem,” European Journal of Operational Research, vol. 155, no. 1, pp. 251–257, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. E. Tardos, “A strongly polynomial algorithm to solve combinatorial linear programs,” Operations Research, vol. 34, no. 2, pp. 250–256, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. B. W. Zhang, J. Z. Zhang, and L. Q. Qi, “The shortest path improvement problems under Hamming distance,” Journal of Combinatorial Optimization, vol. 12, no. 4, pp. 351–361, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. J. Z. Zhang, X. G. Yang, and M. C. Cai, “A network improvement problem under different norms,” Computational Optimization and Applications, vol. 27, no. 3, pp. 305–319, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet