The shortest path improvement problems under Hamming distance

Article

Abstract

In this paper, we consider the shortest path improvement problems under Hamming distance (SPIH), where the weights of edges can be modified only within given intervals. Two models are considered: the general SPIH problem and the SPIH problem with a single pair of required vertices. For the first problem, we show that it is strongly NP-hard. For the second problem, we show that even if the network is a chain network, it is still NP-hard.

Keywords

Shortest path problem NP-hard Hamming distance 

References

  1. Burton D, Toint Ph L (1992) On an instance of the inverse shortest path problem. Math Programming 53:45–61MATHMathSciNetCrossRefGoogle Scholar
  2. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco, CAMATHGoogle Scholar
  3. He Y, Zhang B, Yao E (2005) Weighted inverse minimum spanning tree problems under Hamming distance. J Comb Optim 9(1):91–100MATHMathSciNetCrossRefGoogle Scholar
  4. Xu S, Zhang J (1995) An inverse problem of the weighted shortest path problem. Japan J Ind Appl Math 12:47–59MATHMathSciNetCrossRefGoogle Scholar
  5. Zhang J, Lin Y (2003) Computation of the reverse shortest-path problem. J. Global Optim 25:243–261MATHMathSciNetCrossRefGoogle Scholar
  6. Zhang J, Ma Z, Yang C (1995) A column generation method for inverse shortest path problems. ZOR-Math Methods Oper Res 41:347–358MATHMathSciNetCrossRefGoogle Scholar
  7. Zhang B, Zhang J, He Y (2005) The center location improvement under Hamming distance. J Comb Optim 9(2):187–198MATHMathSciNetCrossRefGoogle Scholar
  8. Zhang B, Zhang J, He Y (2006) Constrained inverse minimum spanning tree problems under bottleneck-type Hamming distance. J Global Optim 34:467–474MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Department of Mathematics and PhysicsHohai UniversityChangzhouChina
  2. 2.Department of System Engineering and Engineering ManegementThe Chinese University of Hong KongHong KongChina
  3. 3.Department of MathematicsHong Kong Polytechnic UniversityHong KongChina

Personalised recommendations