A Unified Approach to Box-Mengerian Hypergraphs

References

• Apollonio N. Integrality properties of edge path tree families. Discrete Math. (2009) 309:4181–4184Crossref, Google Scholar
• Bixby R. E., Cunningham W. H. Converting linear programs to network problems. Math. Oper. Res. (1980) 5:321–357Link, Google Scholar
• Bixby R. E., Wagner D. K. An almost linear time algorithm for graph realization. Math. Oper. Res. (1988) 5:99–123Link, Google Scholar
• Cai M., Deng X., Zang W. An approximation algorithm for feedback vertex sets in tournaments. SIAM J. Comput. (2001) 30:1993–2007Crossref, Google Scholar
• Chen X., Chen Z., Zang W. A unified approach to box-Mengerian hypergraphs. (2009) . IMR Preprint 19, Department of Mathematics, University of Hong Kong, Hong KongGoogle Scholar
• Chen X., Ding G., Zang W. A characterization of box-Mengerian matroid ports. Math. Oper. Res. (2008) 33:497–512Link, Google Scholar
• Cook W. On box totally dual integral polyhedra. Math. Programming (1986) 34:48–61Crossref, Google Scholar
• Ding G., Zang W. Packing cycles in graphs. J. Combin. Theory Ser. B (2002) 86:381–407Crossref, Google Scholar
• Ding G., Zang W. Packing circuits in matroids. Math. Programming Ser. A (2009) 119:137–168Crossref, Google Scholar
• Ding G., Feng L., Zang W. The complexity of recognizing linear systems with certain integrality properties. Math. Programming Ser. A (2008) 114:321–334Crossref, Google Scholar
• Edmonds J., Giles R. A min-max relation for submodular functions on graphs. Annals Discrete Math. (1977) 1:185–204Crossref, Google Scholar
• Fournier J. C. Hypergraphes de chaines d'aretes d'un arbre. Discrete Math. (1983) 43:29–36Crossref, Google Scholar
• Fujishige S. An efficient PQ-graph algorithm for solving the graph realization problem. J. Comput. System Sci. (1980) 21:63–86Crossref, 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
• Laurent M., Poljak S. One-third-integrality in the max-cut problem. Math. Programming (1995) 71:29–50Crossref, Google Scholar
• Oxley J.Matroid Theory (1992) (Oxford University Press, Oxford, UK) Google Scholar
• Schrijver A., Pulleyblank W. R. Total dual integrality from directed graphs, crossing families, and sub- and supermodular functions. Progress in Combinatorial Optimization (1984) (Academic Press, Toronto) 315–361Crossref, 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
• Schrijver A., Seymour P. D. A proof of total dual integrality of matching polyhedra. (1977) . Mathematical Centre Report ZN 79/77, Mathematical Centre, AmsterdamGoogle Scholar
• Seymour P. D. The matroids with the max-flow min-cut property. J. Combin. Theory Ser. B (1977) 23:189–222Crossref, Google Scholar