Complexity of Minimum Irreducible Infeasible Subsystem Covers for Flow Networks. Joormann, I. & Pfetsch, M. Technical Report Optimization Online, March, 2015.
Complexity of Minimum Irreducible Infeasible Subsystem Covers for Flow Networks [link]Paper  bibtex   
@TechReport{Joormann2015,
  author      = {I. Joormann and M.E. Pfetsch},
  title       = {Complexity of Minimum Irreducible Infeasible Subsystem Covers for Flow Networks},
  institution = {Optimization Online},
  year        = {2015},
  month       = {March},
  owner       = {joormann},
  timestamp   = {2015.03.29},
  url         = {http://www.optimization-online.org/DB_HTML/2015/03/4809.html},
}

Downloads: 0