Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 847317, 8 pages
http://dx.doi.org/10.1155/2013/847317
Research Article

Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance

1Department of Mathematics and Physics, Hohai University, Changzhou 213022, China
2Department of Mathematics, Southeast University, Nanjing 210096, China

Received 1 July 2013; Accepted 19 August 2013

Academic Editor: Frank Werner

Copyright © 2013 Bingwu Zhang 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. D. Burton and Ph. L. Toint, “On an instance of the inverse shortest paths problem,” Mathematical Programming, vol. 53, no. 1, pp. 45–61, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. J. Z. Zhang, Z. F. Ma, and C. Yang, “A column generation method for inverse shortest path problems,” Zeitschrift für Operations Research. Mathematical Methods of Operations Research, vol. 41, no. 3, pp. 347–358, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. 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
  4. X. C. Guan and J. Z. Zhang, “A class of node based bottleneck improvement problems,” European Journal of Operational Research, vol. 174, no. 3, pp. 1540–1552, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. X. C. Guan and J. Z. Zhang, “Improving multicut in directed trees by upgrading nodes,” European Journal of Operational Research, vol. 183, no. 3, pp. 971–980, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. C. Heuberger, “Inverse combinatorial optimization: a survey on problems, methods, and results,” Journal of Combinatorial Optimization, vol. 8, no. 3, pp. 329–361, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  7. Y. He, B. W. Zhang, and E. Y. Yao, “Weighted inverse minimum spanning tree problems under Hamming distance,” Journal of Combinatorial Optimization, vol. 9, no. 1, pp. 91–100, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. 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
  9. B. W. Zhang, J. Z. Zhang, and Y. He, “The center location improvement problem under the Hamming distance,” Journal of Combinatorial Optimization, vol. 9, no. 2, pp. 187–198, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. B. W. Zhang, J. Z. Zhang, and Y. He, “Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance,” Journal of Global Optimization, vol. 34, no. 3, pp. 467–474, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. C. W. Duin and A. Volgenant, “Some inverse optimization problems under the Hamming distance,” European Journal of Operational Research, vol. 170, no. 3, pp. 887–899, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. X. C. Guan and J. Z. Zhang, “Inverse bottleneck optimization problems on networks,” in Algorithmic Aspects in Information and Management, vol. 4041 of Lecture Notes in Computer Science, pp. 220–230, 2006. View at Publisher · View at Google Scholar
  13. L. C. Liu and E. Y. Yao, “Inverse min-max spanning tree problem under the weighted sum-type Hamming distance,” Theoretical Computer Science, vol. 396, no. 1–3, pp. 28–34, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. Y. W. Jiang, L. C. Liu, B. Wu, and E. Y. Yao, “Inverse minimum cost flow problems under the weighted Hamming distance,” European Journal of Operational Research, vol. 207, no. 1, pp. 50–54, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet