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
{"_id":"Xv38pkM2jnohvLngB","bibbaseid":"joormann-pfetsch-complexityofminimumirreducibleinfeasiblesubsystemcoversforflownetworks-2018","authorIDs":[],"author_short":["Joormann, I.","Pfetsch, M."],"bibdata":{"bibtype":"article","type":"article","title":"Complexity of Minimum Irreducible Infeasible Subsystem Covers for Flow Networks","author":[{"firstnames":["I."],"propositions":[],"lastnames":["Joormann"],"suffixes":[]},{"firstnames":["M.E."],"propositions":[],"lastnames":["Pfetsch"],"suffixes":[]}],"journal":"Discrete Applied Mathematics","volume":"244","pages":"124–142","year":"2018","publisher":"Elsevier","bibtex":"@article{joormann2018complexity,\n title={Complexity of Minimum Irreducible Infeasible Subsystem Covers for Flow Networks},\n author={I. Joormann and M.E. Pfetsch},\n journal={Discrete Applied Mathematics},\n volume={244},\n pages={124--142},\n year={2018},\n publisher={Elsevier}\n}\n\n","author_short":["Joormann, I.","Pfetsch, M."],"key":"joormann2018complexity","id":"joormann2018complexity","bibbaseid":"joormann-pfetsch-complexityofminimumirreducibleinfeasiblesubsystemcoversforflownetworks-2018","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"article","biburl":"https://mo.tu-bs.de/static/bib/imo.bib","creationDate":"2020-07-28T07:44:50.652Z","downloads":0,"keywords":[],"search_terms":["complexity","minimum","irreducible","infeasible","subsystem","covers","flow","networks","joormann","pfetsch"],"title":"Complexity of Minimum Irreducible Infeasible Subsystem Covers for Flow Networks","year":2018,"dataSources":["vcDsPHbbKeoCYBk3t"]}