Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
From MaRDI portal
Publication:2455841
DOI10.1080/10020070612330048zbMath1133.90388MaRDI QIDQ2455841
Publication date: 26 October 2007
Published in: Progress in Natural Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10020070612330048
computational complexity; inverse problem; minimum spanning tree; shortest-path problem; reverse problem
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items
Inverse minimum cost flow problems under the weighted Hamming distance, Weighted inverse maximum perfect matching problems under the Hamming distance, Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes