Efficient Algorithms for the Inverse Spanning-Tree Problem
From MaRDI portal
Publication:3637389
DOI10.1287/opre.51.5.785.16756zbMath1165.90658OpenAlexW2007619042MaRDI QIDQ3637389
Publication date: 9 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.51.5.785.16756
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)
Related Items (26)
The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ Partial inverse min-max spanning tree problem ⋮ Inverse eccentric vertex problem on networks ⋮ Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes ⋮ Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy ⋮ Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm ⋮ Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck 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 ⋮ The partial inverse minimum spanning tree problem when weight increase is forbidden ⋮ The minmax regret inverse maximum weight problem ⋮ Data-driven inverse optimization with imperfect information ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ Complexity of some inverse shortest path lengths problems ⋮ 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 ⋮ Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance ⋮ Inverse Optimization with Noisy Data ⋮ Inverse min-max spanning r-arborescence problem under the weighted sum-type Hamming distance ⋮ Weak optimal inverse problems of interval linear programming based on KKT conditions ⋮ 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 ⋮ Partial inverse maximum spanning tree problem under the Chebyshev norm
This page was built for publication: Efficient Algorithms for the Inverse Spanning-Tree Problem
