Analyzing infeasible flow networks

MaRDI QIDQ2827273zbMATH OpenFDO

Authors Imke Joormann

Publication date 13 October 2016

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)

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; zbMATH DE number 49483
• scientific article; zbMATH DE number 1163815

Cited in

(4)

• Cardinality minimization, constraints, and regularization: a survey
• Multiflow Feasibility: An Annotated Tableau
• 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: Analyzing infeasible flow networks

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