Solving Inverse Spanning Tree Problems Through Network Flow Techniques
From MaRDI portal
Publication:2770110
DOI10.1287/opre.47.2.291zbMath0979.90119OpenAlexW2143676338MaRDI QIDQ2770110
P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin
Publication date: 7 February 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.47.2.291
transportation problemundirected graphbipartite networkweighted versioncost scaling algorithminverse spanning tree problemminimax version
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes, Inverse minimum flow problem, Approximation algorithms for capacitated partial inverse maximum spanning tree problem, 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 multi-objective combinatorial optimization, The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments, 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, Weighted inverse minimum spanning tree problems under Hamming distance, The inverse maximum flow problem consideringl∞norm, The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm, Inverse conic programming with applications, 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, The base-matroid and inverse combinatorial optimization problems., Inverse optimization for linearly constrained convex separable programming problems, 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, Some inverse optimization problems under the Hamming distance, Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks
