Opposite Elements in Clutters

References

• Abdi A, Pashkovich K (2017) Deltas, delta minors and delta free clutters. Submitted.Google Scholar
• Abdi A, Cornuéjols G, Pashkovich K (2017) Ideal clutters that do not pack. Math. Oper. Res. Forthcoming.Link, Google Scholar
• Abdi A, Feldmann AE, Guenin B, Könemann J, Sanità L (2016) Lehman’s theorem and the directed Steiner tree problem. SIAM J. Discrete Math. 30(1):141–153.Crossref, Google Scholar
• Berge C (1976) Graphs and Hypergraphs (North Holland, Amsterdam).Google Scholar
• Bridges WG, Ryser HJ (1969) Combinatorial designs and related systems. J. Algebra 13(3):432–446.Crossref, Google Scholar
• Chopra S, Rao MR (1994) The Steiner tree problem I: Formulations, compositions and extension of facets. Math. Program. 64(1–3): 209–229.Crossref, Google Scholar
• Conforti M, Cornuéjols G (1993) Clutters that pack and the max-flow min-cut property: A conjecture. The Fourth Bellairs Workshop on Combinatorial Optimization.Crossref, Google Scholar
• Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming (Springer International, Cham, Switzerland).Crossref, Google Scholar
• Cornuéjols G (2001) Combinatorial Optimization, Packing and Covering (SIAM, Philadelphia).Crossref, Google Scholar
• Cornuéjols G, Guenin B, Margot F (2000) The packing property. Math. Program. Ser. A 89(1):113–126.Crossref, Google Scholar
• Edmonds J (1967) Optimum branchings. J. Res. Nat. Bur. Standards 71B(4):233–240.Crossref, Google Scholar
• Edmonds J, Fulkerson DR (1970) Bottleneck extrema. J. Combin. Theory Ser. B 8(3):299–306.Crossref, Google Scholar
• Egerváry E (1931) On combinatorial properties of matrices (in Hungarian). Matematikai és Fizikai Lapok 38:16–28.Google Scholar
• Ford LR, Fulkerson DR (1956) Maximal flow through a network. Canadian J. Math. 8(1):399–404.Crossref, Google Scholar
• Fulkerson DR (1971) Blocking and anti-blocking pairs of polyhedra. Math. Program. 1(1):168–194.Crossref, Google Scholar
• Goemans MX (1994) Arborescence polytopes for series-parallel graphs. Discrete Appl. Math. 51(3):277–289.Crossref, Google Scholar
• Isbell JR (1958) A class of simple games. Duke Math. J. 25(3):423–439.Crossref, Google Scholar
• Kőnig D (1931) Graphs and matrices (in Hungarian). Matematikai és Fizikai Lapok 38:116–119.Google Scholar
• Lehman A (1964) A solution of the Shannon switching game. Society for Industrial Appl. Math. 12(4):687–725.Crossref, Google Scholar
• Lehman A (1979) On the width-length inequality. Math. Program. 17(1):403–417.Crossref, Google Scholar
• Lehman A (1990) The width-length inequality and degenerate projective planes. Cook W, Seymour PD, eds. Polyhedral Combinatorics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 1 (AMS, Providence, RI), 101–105.Google Scholar
• Lütolf C, Margot F (1998) A catalog of minimally nonideal matrices. Math. Methods of Oper. Res. 47(2):221–241.Crossref, Google Scholar
• Menger K (1927) Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10:96–115.Crossref, Google Scholar
• Nash-Williams CSJA (1961) Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36(1):445–450.Crossref, Google Scholar
• Prodon A, Liebling TM, Gröflin H (1985) Steiner’s problem on 2-trees. Research Report RO 850315, Ecole Polytechnique de Lausanne.Google Scholar
• Schaffers M (1991) Network flow design III. Polyhedral characterization of the single source fixed costs problem on series-parallel graphs. CORE Discussion Paper, Université Catholique de Louvain, Louvain.Google Scholar
• Schrijver A (2003) Combinatorial Optimization: Polyhedra and Efficiency (Springer, Berlin).Google Scholar
• Seymour PD (1976) The forbidden minors of binary matrices. J. London Math. Soc. 2(12):356–360.Crossref, Google Scholar
• Seymour PD (1977) The matroids with the max-flow min-cut property. J. Combin. Theory Ser. B 23(2–3):189–222.Crossref, Google Scholar
• Seymour PD (1990) On Lehman’s width-length characterization. Cook W, Seymour PD, eds. Polyhedral Combinatorics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 1 (AMS, Providence, RI), 107–117.Google Scholar
• Tutte WT (1961) On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 36(1):221–230.Crossref, Google Scholar
• Vazirani VV (2001) Approximation Algorithms (Springer, Berlin).Google Scholar
• Yannakakis M (1991) Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3):441–466.Crossref, Google Scholar