Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance

Hui Wang, Xiucui Guan (), Qiao Zhang and Binwu Zhang
Additional contact information
Hui Wang: Southeast University
Xiucui Guan: Southeast University
Qiao Zhang: Southeast University
Binwu Zhang: Hohai University

Journal of Combinatorial Optimization, 2021, vol. 41, issue 4, No 6, 887 pages

Abstract: Abstract We consider the capacitated inverse optimal value problem on minimum spanning tree under Hamming distance. Given a connected undirected network $$G=(V,E)$$ G = ( V , E ) and a spanning tree $$T^0$$ T 0 , we aim to modify the weights of the edges such that $$T^0$$ T 0 is not only the minimum spanning tree under the new weights but also the weight of $$T^0$$ T 0 is equal to a given value K. The objective is to minimize the modification cost under bottleneck Hamming distance. We add a lower bound l and an upper bound u on the modification of weights and consider three cases (uncapacitated, lower bounded, capacitated) of the problem based on the bound vectors. Suppose $$l=-\,\infty , u=+\,\infty $$ l = - ∞ , u = + ∞ in the uncapacitated problem, $$l>-\,\infty , u=+\,\infty $$ l > - ∞ , u = + ∞ in the lower bounded problem and $$l>-\,\infty , u - ∞ , u

Keywords: Minimum spanning tree; Hamming distance; Inverse optimal value problem; Capacitated inverse optimization problem; Binary search (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00721-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:41:y:2021:i:4:d:10.1007_s10878-021-00721-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00721-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().