Combinatorial Algorithms for Inverse Network Flow Problems

Networks

Volumn 40, Issue 4, 2002, Pages 181-187

  Ahuja, Ravindra K ^a   Orlin, James B ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Inverse optimization; Maximum flow problem; Minimax problems; Minimum mean cycle problem; Minimum cost flow problem; Minimum cut problem

Indexed keywords

ALGORITHMS; INVERSE PROBLEMS; PERTURBATION TECHNIQUES; POLYNOMIALS; VECTORS;

COMBINATORIAL ALGORITHMS;

COMBINATORIAL MATHEMATICS;

EID: 0141764696     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10048     Document Type: Article

References (19)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms, and applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. R.K. Ahuja and J.B. Orlin, Inverse optimization, Oper Res 49 (2001), 771-783.
3. H.N. Gabow and R.E. Tarjan, Faster scaling algorithms for network problems, SIAM J Comput 18 (1989), 1013-1036.
4. A.V. Goldberg, Scaling algorithms for the shortest path problem, SIAM J Comput 24 (1995), 494-504.
5. A.V. Goldberg and S. Rao, Beyond the flow decomposition barrier, J ACM 45 (1998), 783-797.
6. th ACM Symp on the Theory of Computing, 1986, pp. 136-146. Full paper in J ACM 35 (1990), 873-886.
7. th ACM Symp on the Theory of Computing, 1986, pp. 136-146. Full paper in J ACM 35 (1990), 873-886.
8. D.S. Hochbaum and J.G. Shantikumar, Convex separable optimization is not much harder than linear optimization, J ACM 37 (1990), 843-862.
9. R.M. Karp, A characterization of the minimum cycle mean in a digraph, Discr Math 23 (1978), 309-311.
10. R.M. Karp and J.B. Orlin, Parametric shortest path algorithms with an application to cyclic staffing, Discr Appl Math 3 (1981), 37-45.
11. A.V. Karzanov and S.T. McCormick, Polynomial methods for separable convex optimization in totally unimodular linear spaces with applications in circulations and co-circulations in networks, SIAM J Comput 26 (1997), 1245-1275.
12. E.L. Lawler, "Optimal cycles in doubly weighted linear graphs, " Theory of graphs: International symposium, Dunod, Paris, Gordon and Breach, New York, 1966, pp. 209-213.
13. S.T. McCormick, How to compute least infeasible flows, Math Program B 78 (1997), 179-194.
14. N. Megiddo, Combinatorial optimization with rational objective functions, Math Oper Res 4 (1979), 414-424.
15. J.B. Orlin and R.K. Ahuja, New scaling algorithms for the assignment and minimum mean cycle problems, Math Program 54 (1992), 41-56.
16. T. Radzik, "Parametric flows, weighted means of cuts, and fractional combinatorial optimization," Complexity in numerical optimization, P. Pardalos (Editor), World Scientific, River Edge, NJ, 1983, pp. 351-386.
17. C. Yang, J. Zhang, and Z. Ma, Inverse maximum flow and minimum cut problem, Optimization 40 (1997), 147-170.
18. J. Zhang and M. Cai, Inverse problem of minimum cuts, ZOR Math Methods Oper Res 48 (1998), 51-58.
19. J. Zhang and Z. Liu, Calculating some inverse linear programming problem, J Comput Appl Math 72 (1996), 261-273.