Weighted inverse minimum spanning tree problems under Hamming distance
From MaRDI portal
Recommendations
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- Inverse constrained minimum spanning tree problem under Hamming distance
- 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
Cites work
- scientific article; zbMATH DE number 949659 (Why is no real title available?)
- 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
- An algorithm for inverse minimum spanning tree problem
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Network flows. Theory, algorithms, and applications.
- Solution structure of some inverse combinatorial optimization problems
- Solving inverse spanning tree problems through network flow techniques
Cited in
(41)- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- 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
- Inverse minimum flow problem under the weighted sum-type Hamming distance
- Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm
- Network design for minimum spanning trees under Hamming distance
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
- Inverse max+sum spanning tree problem under weighted l₁ norm by modifying the sum-cost vector
- A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
- Inverse cost limit of constrained minimum spanning tree problem under Hamming distance
- 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 constrained minimum spanning tree problem under Hamming distance
- 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
- Capacity inverse minimum cost flow problems under the weighted Hamming distance
- Partial inverse min-max spanning tree problem under the weighted bottleneck 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
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Constrained inverse minimum flow problems under the weighted Hamming distance
- 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
- Optimal algorithms for inverse eccentric vertex location problem on extended star networks
- Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted l_ 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
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)
