Diagnosing infeasibilities in network flow problems

DOI10.1007/BF01580084zbMath0919.90059MaRDI QIDQ1290604

James B. Orlin, Charu C. Aggarwal, Jianxiu Hao, Ravindra K. Ahuja

Publication date: 5 September 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

network flowsmaximum flowfeasibility problemfeasible flow in a directed networkminimum rooted cut problempreflow-push algorithmwitness of infeasibility

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items

How to compute least infeasible flows, A study on modularity density maximization: column generation acceleration and computational complexity analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Irreducibly inconsistent systems of linear inequalities
• A data structure for dynamic trees
• Analysis of Preflow Push Algorithms for Maximum Network Flow
• Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
• A new approach to the maximum-flow problem
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• A Fast Parametric Maximum Flow Algorithm and Applications