Inverse max+sum spanning tree problem under weighted l_ norm by modifying max-weight vector
From MaRDI portal
Publication:2089873
Recommendations
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Inverse max+sum spanning tree problem under weighted l₁ norm by modifying the sum-cost vector
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- 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
Cites work
- 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
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
- On combined minmax-minsum optimization
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
- Partial inverse min-max spanning tree problem
- Solving combinatorial problems with combined min-max-min-sum objective 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
- Some inverse optimization problems under the Hamming distance
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Weighted inverse minimum spanning tree problems under Hamming distance
Cited in
(7)- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
This page was built for publication: Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089873)
