Inverse optimal value problem on minimum spanning tree under unit l_ norm
From MaRDI portal
Publication:2228401
Recommendations
- The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted l_ norm
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
- An algorithm for inverse minimum spanning tree problem
Cites work
- scientific article; zbMATH DE number 949659 (Why is no real title available?)
- A Faster Algorithm for the Inverse Spanning Tree Problem
- A network flow method for solving some inverse combinatorial optimization problems
- A penalty function method for solving inverse optimal value problem
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- An algorithm for inverse minimum spanning tree problem
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Inverse max+sum spanning tree problem under weighted l₁ norm by modifying the sum-cost vector
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Network flows. Theory, algorithms, and applications.
- Solving inverse spanning tree problems through network flow techniques
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- The inverse optimal value problem
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Weighted inverse minimum spanning tree problems under Hamming distance
Cited in
(17)- Inverse optimization problems with multiple weight functions
- Solving inverse spanning tree problems through network flow techniques
- Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm
- The minmax regret inverse maximum weight problem
- Inverse max+sum spanning tree problem under weighted l₁ norm by modifying the sum-cost vector
- Inverse bottleneck Steiner tree problem under norm
- 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 max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
- The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees
- Best strategy to win a match: an analytical approach using hybrid machine learning-clustering-association rule framework
- 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
- Partial inverse maximum spanning tree problem under the Chebyshev norm
- A penalty-type method for solving inverse optimal value problem in second-order conic programming
This page was built for publication: Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228401)
