A characterization of irreducible infeasible subsystems in flow networks

DOI10.1002/net.21686zbMath1390.90110OpenAlexW2472452898MaRDI QIDQ4642408

Marc E. Pfetsch, Imke Joormann, James B. Orlin

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/111098

zbMATH Keywords

infeasibility analysisflow network\(\mathcal{NP}\)-hardnesswitnessirreducible infeasible subsystemmax flow-min cutGale-Hoffman theorem

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (2)

Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ A system to evaluate gas network capacities: concepts and implementation

This page was built for publication: A characterization of irreducible infeasible subsystems in flow networks