Inverse max $$+$$ + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
Crossref DOI link: https://doi.org/10.1007/s10898-017-0546-5
Published Online: 2017-07-15
Published Print: 2017-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Guan, Xiucui
He, Xinyan
Pardalos, Panos M.
Zhang, Binwu
Funding for this research was provided by:
National Natural Science Foundation of China (11471073)
License valid from 2017-07-15