The partial inverse minimum spanning tree problem when weight increase is forbidden
From MaRDI portal
Publication:2470099
DOI10.1016/j.ejor.2007.04.031zbMath1149.90390OpenAlexW2159190587MaRDI QIDQ2470099
Mao-cheng Cai, Xiao-guang Yang, Cees W. Duin, Zhang, Jianzhong
Publication date: 13 February 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.04.031
Related Items (17)
The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ Partial inverse min-max spanning tree problem ⋮ Algorithm for constraint partial inverse matroid problem with weight increase forbidden ⋮ Algorithms for the partial inverse matroid problem in which weights can only be increased ⋮ Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm ⋮ Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ A branch-and-bound algorithm for instrumental variable quantile regression ⋮ Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm ⋮ Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ The minmax regret inverse maximum weight problem ⋮ The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance ⋮ Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector ⋮ Partial inverse maximum spanning tree problem under the Chebyshev norm
Cites Work
- Unnamed Item
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
- A further study on inverse linear programming problems
- The base-matroid and inverse combinatorial optimization problems.
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Partial inverse assignment problems under \(l_{1}\) norm
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques
- Inverse Optimization
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Reduction tests for the steiner problem in grapsh
- An algorithm for inverse minimum spanning tree problem
- A Faster Algorithm for the Inverse Spanning Tree Problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- A network flow method for solving some inverse combinatorial optimization problems
This page was built for publication: The partial inverse minimum spanning tree problem when weight increase is forbidden
