Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
From MaRDI portal
Publication:2494303
DOI10.1007/s10898-005-6470-0zbMath1098.90062OpenAlexW2046532265MaRDI QIDQ2494303
Yong He, Binwu Zhang, Zhang, Jianzhong
Publication date: 26 June 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-005-6470-0
Related Items
Partial inverse min-max spanning tree problem, Capacity inverse minimum cost flow problems under the weighted Hamming distance, The shortest path improvement problems under Hamming distance, Inverse maximum flow problems under the weighted Hamming distance, An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance, Approximation algorithms for capacitated partial inverse maximum spanning tree problem, Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector, Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance, Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance, Weighted inverse maximum perfect matching problems under the Hamming distance, On inverse linear programming problems under the bottleneck-type weighted Hamming distance, Inverse 1-median problem on trees under weighted Hamming distance, Inverse min-max spanning tree problem under the weighted sum-type Hamming distance, Heuristic algorithms for the inverse mixed integer linear programming problem, Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm, Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm, Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance, Inverse minimum flow problem under the weighted sum-type Hamming distance, 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, Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector, Inverse minimum cost flow problems under the weighted Hamming distance, Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance, Constrained inverse minimum flow problems under the weighted Hamming distance, Constrained inverse min-max spanning tree problems under the weighted Hamming distance, Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance, Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm, 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, Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks
Cites Work
