Complexity of Minimum Irreducible Infeasible Subsystem Covers for Flow Networks. Joormann, I. & Pfetsch, M. Discrete Applied Mathematics, 244:124–142, Elsevier, 2018.
bibtex   
@article{joormann2018complexity,
  title={Complexity of Minimum Irreducible Infeasible Subsystem Covers for Flow Networks},
  author={I. Joormann and M.E. Pfetsch},
  journal={Discrete Applied Mathematics},
  volume={244},
  pages={124--142},
  year={2018},
  publisher={Elsevier}
}

Downloads: 0