A Characterization of Box-Mengerian Matroid Ports

References

• Bixby R. E. l-matrices and a characterization of binary matroids. Discrete Math. (1974) 8:139–145Crossref, Google Scholar
• Chen X., Ding G., Zang W. The box-TDI system associated with 2-edge connected spanning subgraphs. Discrete Appl. Math. (Forthcoming) Google Scholar
• Cook W. On box totally dual integral polyhedra. Math. Programming (1986) 34:48–61Crossref, Google Scholar
• Cornuéjols G.Combinatorial Optimization: Packing and Covering (2001) (SIAM, Philadelphia) Crossref, Google Scholar
• Ding G., Zang W. Packing circuits in matroids. Math. Programming Ser. A (To appear) Google Scholar
• Edmonds J., Fulkerson D. R. Bottleneck extrema. J. Combin. Theory (1970) 8:299–306Crossref, Google Scholar
• Edmonds J., Giles R. A min-max relation for submodular functions on graphs. Ann. Discrete Math. (1977) 1:185–204Crossref, Google Scholar
• Edmonds J., Giles R., Pulleyblank W. R. Total dual integrality of linear inequality systems. Progress in Combinatorial Optimization (1984) (Academic Press, Toronto) 117–129Crossref, Google Scholar
• Gerards A. M. H., Laurent M. A characterization of box (1/d)-integral binary clutters. J. Combin. Theory Ser. B (1995) 65:186–207Crossref, Google Scholar
• Guenin B. A short proof of Seymour's characterization of the matroids with the max-flow min-cut property. J. Combin. Theory Ser. B (2002) 86:273–279Crossref, Google Scholar
• Laurent M., Poljak S. One-third-integrality in the max-cut problem. Math. Programming (1995) 71:29–50Crossref, Google Scholar
• Lehman A. Matroids and ports. Notices Amer. Math. Soc. (1965) 12:342Google Scholar
• Oxley J.Matroid Theory (1992) (Oxford University Press, Oxford, UK) Google Scholar
• Schrijver A.Theory of Linear and Integer Programming (1986) (John Wiley & Sons, New York) Google Scholar
• Schrijver A.Combinatorial Optimization—Polyhedra and Efficiency (2003) (Springer-Verlag, Berlin) Google Scholar
• Seymour P. D. The forbidden minors of binary clutters. J. London Math. Soc. (1976) 12:356–360Crossref, Google Scholar
• Seymour P. D. A note on the production of matroid minors. J. Combin. Theory Ser. B (1977) 22:289–295Crossref, Google Scholar
• Seymour P. D. The matroids with the max-flow min-cut property. J. Combin. Theory Ser. B (1977) 23:189–222Crossref, Google Scholar
• Seymour P. D. Decomposition of regular matroids. J. Combin. Theory Ser. B (1980) 28:305–359Crossref, Google Scholar
• Truemper K.Matroid Decomposition (1992) (Academic Press, Boston) Google Scholar
• Tseng F. T., Truemper K. A decomposition of the matroids with the max-flow min-cut property. Discrete Appl. Math. (1986) 15:329–364Crossref, Google Scholar
• Tutte W. T. A class of abelian groups. Canadian J. Math. (1956) 8:13–28Crossref, Google Scholar