Solving inverse spanning tree problems through network flow techniques

DOI10.1287/OPRE.47.2.291MaRDI QIDQ2770110zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

transportation problemundirected graphbipartite networkweighted versioncost scaling algorithminverse spanning tree problemminimax version

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• Efficient Algorithms for the Inverse Spanning-Tree Problem
• A Faster Algorithm for the Inverse Spanning Tree Problem
• A network flow method for solving some inverse combinatorial optimization problems
• 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

Cited in

(30)

• Efficient Algorithms for the Inverse Spanning-Tree Problem
• The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
• Inverse multi-objective combinatorial optimization
• 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₁ norm by modifying the sum-cost vector
• 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
• A Faster Algorithm for the Inverse Spanning Tree Problem
• 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
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
• Inverse optimization for linearly constrained convex separable programming problems
• Inverse minimum flow problem
• Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
• 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
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
• Inverse conic programming with applications
• Weighted inverse minimum spanning tree problems under Hamming distance
• The base-matroid and inverse combinatorial optimization problems.
• Representing inverses in pure network flow optimization
• The inverse maximum flow problem consideringl_∞norm
• 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 partial inverse minimum spanning tree problem when weight increase is forbidden
• Some inverse optimization problems under the Hamming distance
• Partial inverse maximum spanning tree problem under the Chebyshev norm
• Complexity of some inverse shortest path lengths problems

This page was built for publication: Solving inverse spanning tree problems through network flow techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770110)