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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burton D, Toint Ph L (1992) On an instance of the inverse shortest path problem. Math Programming 53:45–61
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco, CA
He Y, Zhang B, Yao E (2005) Weighted inverse minimum spanning tree problems under Hamming distance. J Comb Optim 9(1):91–100
Xu S, Zhang J (1995) An inverse problem of the weighted shortest path problem. Japan J Ind Appl Math 12:47–59
Zhang J, Lin Y (2003) Computation of the reverse shortest-path problem. J. Global Optim 25:243–261
Zhang J, Ma Z, Yang C (1995) A column generation method for inverse shortest path problems. ZOR-Math Methods Oper Res 41:347–358
Zhang B, Zhang J, He Y (2005) The center location improvement under Hamming distance. J Comb Optim 9(2):187–198
Zhang B, Zhang J, He Y (2006) Constrained inverse minimum spanning tree problems under bottleneck-type Hamming distance. J Global Optim 34:467–474
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper is dedicated to Dr. Yong He.
Rights and permissions
About this article
Cite this article
Zhang, B., Zhang, J. & Qi, L. The shortest path improvement problems under Hamming distance. J Comb Optim 12, 351–361 (2006). https://doi.org/10.1007/s10878-006-9000-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-9000-1