Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
From MaRDI portal
Publication:2045028
DOI10.1007/s10878-021-00721-5zbMath1473.90145OpenAlexW3148128697MaRDI QIDQ2045028
Xiucui Guan, Hui Wang, Binwu Zhang, Qiao Zhang
Publication date: 11 August 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00721-5
Hamming distanceminimum spanning treebinary searchinverse optimal value problemcapacitated inverse optimization problem
Related Items (4)
The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm ⋮ Partial inverse maximum spanning tree problem under the Chebyshev norm
Cites Work
- Unnamed Item
- Unnamed Item
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- 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
- 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
- The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- 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
- A network flow method for solving some inverse combinatorial optimization problems
This page was built for publication: Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
