Weighted inverse minimum spanning tree problems under Hamming distance

DOI10.1007/S10878-005-5486-1zbMATH Open1066.90104OpenAlexW2044926776MaRDI QIDQ1774530FDOQ1774530

Enyu Yao, Yong He, Binwu Zhang

Publication date: 17 May 2005

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

Full work available at URL: https://doi.org/10.1007/s10878-005-5486-1

zbMATH Keywords

inverse problemminimum spanning treestrongly polynomial algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Solution structure of some inverse combinatorial optimization problems
• Title not available (Why is that?)
• A Faster Algorithm for the Inverse Spanning Tree Problem
• A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
• Solving inverse spanning tree problems through network flow techniques
• An algorithm for inverse minimum spanning tree problem

Cited In (37)

• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Partial inverse min-max spanning tree problem
• On inverse linear programming problems under the bottleneck-type weighted Hamming distance
• Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm
• Inverse minimum flow problem under the weighted sum-type Hamming distance
• Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
• The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• 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
• Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
• Capacity inverse minimum cost flow problems under the weighted Hamming distance
• Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
• Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
• Inverse maximum flow problems under the weighted Hamming distance
• Approximation algorithms for capacitated partial inverse maximum spanning tree problem
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
• Constrained inverse minimum flow problems under the weighted Hamming distance
• Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• Inverse minimum cost flow 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
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
• The center location improvement problem under 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
• The shortest path improvement problems under Hamming distance
• Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Some inverse optimization problems under the Hamming distance
• Partial inverse maximum spanning tree problem under the Chebyshev norm
• Weighted inverse maximum perfect matching problems under the Hamming distance

   Recommendations

• Constrained inverse min-max spanning tree problems under the weighted Hamming distance 👍 👎
• Title not available (Why is that?) 👍 👎
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance 👍 👎
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance 👍 👎
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance 👍 👎

This page was built for publication: Weighted inverse minimum spanning tree problems under Hamming distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774530)