Diagnosing infeasibilities in network flow problems

Mathematical Programming, Series B

Volumn 81, Issue 3, 1998, Pages 263-280

  Aggarwal, Charu C ^a   Ahuja, Ravindra K ^b   Hao, Jianxiu ^c   Orlin, James B ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^c VERIZON   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Maximum flow problem; Network flows; Preflow push algorithm

Indexed keywords

EID: 0041352247     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01580084     Document Type: Article

References (13)

1. J.N.M. Van Loon, Irreducibly inconsistent systems of linear inequalities, European Journal of Operations Research 8 (1981) 283-288.
2. J.W. Chinneck, E.E. Dravnieks, Locating minimal infeasible constraint sets in linear programs, ORSA Journal of Computing 3 (1991) 157-168.
3. H.J. Greenberg, Diagnosing infeasibility of min-cost network flow models, Part II, Primal infeasibility, IMA Journal of Mathematics in Business and Industry 4 (1988) 39-50.
4. H.J. Greenberg, How to analyze the results of linear programs - Part 3: Infeasibility diagnosis, Interfaces 23 (1993) 120-139.
5. D. Gale, A theorem on flows in networks, Pacific Journal of Mathematics 7 (1957) 1073-1082.
6. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
7. J. Hao, J.B. Orlin, A faster algorithm for finding the minimum cut in a graph. Proceedings of the Third Annual ACM-Siam Symposium on Discrete Algorithms, 1992, pp. 165-174 (expanded version accepted for publication by the Journal of Algorithms).
8. G. Gallo, M.D. Gridoriadis, R.E. Tarjan, A fast parametric flow algorithm, SIAM Journal of Computing 18 (1989) 30-55.
9. A.V. Goldberg, R.E. Tarjan, A new approach to the maximum flow problem, Journal of the ACM 35 (1988) 921-940.
10. U. Derigs, W. Meier, Implementing Goldberg's max-flow algorithm: A computational investigation, Zeitschrift für Operations Research 33 (1989) 383-403.
11. J. Cheriyan, S.N. Maheshwari, Analysis of preflow push algorithms for maximum network flow, SIAM Journal on Computing 6 (1989) 1057-1086.
12. D.D. Sleator, R.E. Tarjan, A data structure for dynamic trees, Journal of Computer and System Sciences 24 (1983) 362 391.
13. M.S. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1989.