Minimally Infeasible Set-Partitioning Problems with Balanced Constraints

References

• Berge C., Erdős P., Rényi A., Sós V. On certain hypergraphs generalizing bipartite graphs. Combinatorial Theory and Its Applications I, Colloquia Mathematica Societatis János Bolyai (1970) 4(North Holland, Amsterdam, The Netherlands) 119–133Google Scholar
• Berge C. Balanced matrices. Math. Programming (1972) 2:19–31Crossref, Google Scholar
• Cameron K., Edmonds J. Existentially polynomial theorems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1990) 1(American Mathematical Society, Providence, RI) 83–100Google Scholar
• Conforti M., Cornuéjols G., Kapoor A., Vušković K. Perfect matchings in balanced hypergraphs. Combinatorica (1996) 16:325–329Crossref, Google Scholar
• Conforti M., Cornuéjols G., Rao M. R. Decomposition of balanced matrices. J. Combin. Theory B (1999) 77:292–406Crossref, Google Scholar
• Conforti M., Cornuéjols G., Vušković K., Bondy A., Chvàtal V. Balanced matrices. Discrete Mathematics (2003) (Forthcoming)Google Scholar