Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm
From MaRDI portal
Publication:2088862
DOI10.1016/j.cam.2022.114754zbMath1502.90149OpenAlexW4292830728WikidataQ113878674 ScholiaQ113878674MaRDI QIDQ2088862
Junhua Jia, Binwu Zhang, Xiucui Guan, Hui Wang, Panos M. Pardalos
Publication date: 6 October 2022
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2022.114754
combinatorial optimizationnetworksminimum spanning treebinary search methodrestricted bounded inverse optimal value problem
Cites Work
- Unnamed Item
- A penalty function method for solving inverse optimal value problem
- A further study on inverse linear programming problems
- The inverse optimal value problem
- Weighted inverse minimum spanning tree problems under Hamming distance
- Calculating some inverse linear programming problems
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques
- Complexity of some inverse shortest path lengths problems
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- An algorithm for inverse minimum spanning tree problem
- A Faster Algorithm for the Inverse Spanning Tree Problem