Constrained inverse min-max spanning tree problems under the weighted Hamming distance

DOI10.1007/s10898-008-9294-xzbMath1180.90351OpenAlexW2077423331MaRDI QIDQ1029667

Qin Wang, Longcheng Liu

Publication date: 13 July 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-008-9294-x

zbMATH Keywords

inverse problemsHamming distancestrongly polynomial algorithmsmin-max spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (24)

Partial inverse min-max spanning tree problem ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ The inverse parallel machine scheduling problem with minimum total completion time ⋮ Upgrading min-max spanning tree problem under various cost functions ⋮ 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 ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ 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 ⋮ Weighted inverse maximum perfect matching problems under the Hamming distance ⋮ On inverse linear programming problems under the bottleneck-type weighted Hamming distance ⋮ 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 ⋮ The minmax regret inverse maximum weight problem ⋮ 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 ⋮ Constrained inverse minimum flow problems under the weighted 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 ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Cites Work

• The Min-Max Spanning Tree Problem and some extensions
• Weighted inverse minimum spanning tree problems under Hamming distance
• The center location improvement problem under the Hamming distance
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow problems under the weighted Hamming distance
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Some inverse optimization problems under the Hamming distance
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
• Inverse Bottleneck Optimization Problems on Networks
• Computing and Combinatorics

This page was built for publication: Constrained inverse min-max spanning tree problems under the weighted Hamming distance