Diagnosing infeasibilities in network flow problems

DOI10.1007/BF01580084MaRDI QIDQ1290604zbMATH OpenFDO

Authors Charu C. Aggarwal, Jianxiu Hao, James B. Orlin, 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) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
• How to compute least infeasible flows
• Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
• A characterization of irreducible infeasible subsystems in flow networks
• Analyzing infeasible flow networks

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 742961 (Why is no real title available?)
• A Fast Parametric Maximum Flow Algorithm and Applications
• A data structure for dynamic trees
• A new approach to the maximum-flow problem
• A theorem on flows in networks
• Analysis of Preflow Push Algorithms for Maximum Network Flow
• Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• Irreducibly inconsistent systems of linear inequalities
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Network flows. Theory, algorithms, and applications.

Cited in

(7)

• How to compute least infeasible flows
• Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
• A study on modularity density maximization: column generation acceleration and computational complexity analysis
• A new algorithm for solving the feasibility problem of a network flow
• Localizing and Diagnosing Infeasibilities in Networks
• A characterization of irreducible infeasible subsystems in flow networks
• Complexity of minimum irreducible infeasible subsystem covers for flow networks

This page was built for publication: Diagnosing infeasibilities in network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290604)