Combinatorial algorithms for inverse network flow problems
From MaRDI portal
Publication:4798190
DOI10.1002/net.10048zbMath1026.90089WikidataQ59592562 ScholiaQ59592562MaRDI QIDQ4798190
Ravindra K. Ahuja, James B. Orlin
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
minimax problems; inverse optimization; maximum-flow problem; minimum-cut problem; minimum-cost flow problem minimum mean-cycle problem
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
A perturbation approach for a type of inverse linear programming problems, Inverse problems and solution methods for a class of nonlinear complementarity problems, A perturbation approach for an inverse quadratic programming problem, The inverse maximum dynamic flow problem, Inverse minimum flow problem, A smoothing Newton method for a type of inverse semi-definite quadratic programming problem, An augmented Lagrangian method for a class of Inverse quadratic programming problems, Inverse optimization for linearly constrained convex separable programming problems, Capacity inverse minimum cost flow problem, Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem, The inverse maximum flow problem consideringl∞norm
Cites Work