Ideal Clutters That Do Not Pack

References

• Abdi A, Pashkovich K (2017) Deltas, delta minors and delta-free clutters. Submitted.Google Scholar
• Abdi A, Fukasawa R, Sanità L (2017) Opposite elements in clutters. Math. Oper. Res. ePub ahead of print September 18, https://doi.org/10.1287/moor.2017.0864.Link, Google Scholar
• Abdi A, Cornuéjols G, Guričanová N, Lee D (2017) The polarity conjecture. In preparation.Google Scholar
• Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming (Springer, Cham, Switzerland).Crossref, Google Scholar
• Cornuéjols G, Lee D (2016) On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank. Louveaux Q, Skutella M, eds. Proc. 18th Internat. Conf. Integer Programming Combinatorial Optimization, IPCO ’16, Lecture Notes in Computer Science, Vol. 9682 (Springer International, Cham, Switzerland), 300–311.Crossref, Google Scholar
• Cornuéjols G, Guenin B, Margot F (2000) The packing property. Math. Programming 89(1):113–126.Crossref, Google Scholar
• Edmonds J, Fulkerson DR (1970) Bottleneck extrema. J. Combin. Theory Ser. B 8(3):299–306.Crossref, Google Scholar
• Fulkerson DR (1971) Blocking and anti-blocking pairs of polyhedra. Math. Programming 1(1):168–194.Crossref, Google Scholar
• Guenin B (1998) Perfect and ideal 0, ± 1 matrices. Math. Oper. Res. 23(2):322–338.Link, Google Scholar
• Isbell JR (1958) A class of simple games. Duke Math. J. 25(3):423–439.Crossref, Google Scholar
• Lehman A (1979) On the width-length inequality. Math. Programming 17(1):403–417.Crossref, Google Scholar
• Lehman A (1990) The width-length inequality and degenerate projective planes. DIMACS, Vol. 1, 101–105.Google Scholar
• Lovász L (1972) Minimax Theorems for Hypergraphs, Lecture Notes in Mathematics, Vol. 411 (Springer, Berlin), 111–126.Google Scholar
• Lucchesi CL, Younger DH (1978) A minimax relation for directed graphs. J. London Math. Soc. 2(17):369–374.Crossref, Google Scholar
• Nobili P, Sassano A (1998) (0, ± 1) ideal matrices. Math. Programming 80(3):265–281.Crossref, Google Scholar
• Schrijver A (1980) A counterexample to a conjecture of Edmonds and Giles. Discrete Math. 32(2):213–214.Crossref, 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. DIMACS, Vol. 1, 107–117.Google Scholar
• Woodall DR (1978) Menger and Kőnig Systems , Alavi Y, Lick DR, eds. Theory and Applications of Graphs, Lecture Notes in Mathematics, Vol. 624 (Springer, New York), 620–635.Crossref, Google Scholar