The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
From MaRDI portal
Publication:2022333
DOI10.1007/s10898-020-00947-3zbMath1466.90118OpenAlexW3084636652MaRDI QIDQ2022333
Yan Liu, Panos M. Pardalos, Xiucui Guan, Binwu Zhang, Hui Wang, Qiao Zhang, Shu-Yi Chen
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00947-3
minimum spanning tree\(l_\infty\) normstrongly polynomial time algorithminverse optimal value problem
Related Items
The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees, Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
Cites Work
- Unnamed Item
- Unnamed Item
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- A penalty function method for solving inverse optimal value problem
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
- The inverse optimal value problem
- Weighted inverse minimum spanning tree problems under Hamming distance
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques
- 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
