Analyzing infeasible flow networks

zbMATH Open1353.90030MaRDI QIDQ2827273FDOQ2827273

Authors: Imke Joormann 

Publication date: 13 October 2016

Recommendations

• A characterization of irreducible infeasible subsystems in flow networks
• Complexity of minimum irreducible infeasible subsystem covers for flow networks
• Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
• scientific article
• scientific article; zbMATH DE number 1163815

zbMATH Keywords

linear equationslinear inequalitiesnetwork modelsspecial problems of the linear programming

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Linear equations (linear algebraic aspects) (15A06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Linear inequalities of matrices (15A39)

Cited In (3)

• Cardinality minimization, constraints, and regularization: a survey
• Complexity of minimum irreducible infeasible subsystem covers for flow networks
• Multiflow Feasibility: An Annotated Tableau

This page was built for publication: Analyzing infeasible flow networks

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