Combinatorial algorithms for inverse network flow problems

DOI10.1002/net.10048zbMath1026.90089OpenAlexW2171588996WikidataQ59592562 ScholiaQ59592562MaRDI QIDQ4798190

James B. Orlin, Ravindra K. Ahuja

Publication date: 19 March 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/2698

zbMATH Keywords

minimax problemsinverse optimizationmaximum-flow problemminimum-cut problemminimum-cost flow problem minimum mean-cycle problem

Mathematics Subject Classification ID

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

Related Items (28)

The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ Inverse eccentric vertex problem on networks ⋮ Inverse minimum flow problem ⋮ A perturbation approach for an inverse quadratic programming problem ⋮ The inverse maximum dynamic flow problem ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ On inverse linear programming problems under the bottleneck-type weighted Hamming distance ⋮ A majorized penalty approach to inverse linear second order cone programming problems ⋮ The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones ⋮ The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments ⋮ A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems ⋮ A perturbation approach for a type of inverse linear programming problems ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ Inverse semidefinite quadratic programming problem with \(l_1\) norm measure ⋮ An inverse optimization approach for a capacitated vehicle routing problem ⋮ The minmax regret inverse maximum weight problem ⋮ Inverse quadratic programming problem with \(l_1\) norm measure ⋮ A smoothing Newton method for a type of inverse semi-definite quadratic programming problem ⋮ Inverse problems and solution methods for a class of nonlinear complementarity problems ⋮ Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem ⋮ Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ Capacity inverse minimum cost flow problem ⋮ The inverse maximum flow problem consideringl_∞norm ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ An augmented Lagrangian method for a class of Inverse quadratic programming problems ⋮ An alternating direction method for solving a class of inverse semi-definite quadratic programming problems ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Cites Work

• A characterization of the minimum cycle mean in a digraph

This page was built for publication: Combinatorial algorithms for inverse network flow problems