The following pages link to Michele Conforti (Q203960):
Displaying 50 items.
- The projected faces property and polyhedral relations (Q263204) (← links)
- Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
- A counterexample to a conjecture of Gomory and Johnson (Q431022) (← links)
- Perfect \(0,\pm 1\) matrices (Q677152) (← links)
- Perfect graphs, partitionable graphs and cutsets (Q700371) (← links)
- Stable sets and graphs with no even holes (Q745687) (← links)
- (Q790043) (redirect page) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- Decomposing Berge graphs containing no proper wheel, long prism or their complements (Q879162) (← links)
- Reverse split rank (Q896287) (← links)
- Compact formulations as a union of polyhedra (Q927156) (← links)
- Equivalence between intersection cuts and the corner polyhedron (Q974981) (← links)
- The mixing set with divisible capacities: a simple approach (Q1043241) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction (Q1086161) (← links)
- A construction for binary matroids (Q1102297) (← links)
- Sequentially rejective pairwise testing procedures (Q1108720) (← links)
- A characterization of matroidal systems of inequalities (Q1118603) (← links)
- Balanced cycles and holes in bipartite graphs (Q1297428) (← links)
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- Universally signable graphs (Q1375057) (← links)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- On the cut polyhedron. (Q1426123) (← links)
- A theorem of Truemper (Q1586353) (← links)
- Optimality certificates for convex minimization and Helly numbers (Q1728383) (← links)
- Disjoint paths in arborescences (Q1773369) (← links)
- Subgraph polytopes and independence polytopes of count matroids (Q1785403) (← links)
- Extreme functions with an arbitrary number of slopes (Q1801005) (← links)
- On the geometric structure of independence systems (Q1824559) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- Shortest paths in conservative graphs (Q1841900) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm (Q1850526) (← links)
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality (Q1919803) (← links)
- A polyhedral approach to an integer multicommodity flow problem (Q1975361) (← links)
- Recognizing Cartesian products of matrices and polytopes (Q2056923) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Extended formulations for stable set polytopes of graphs without two disjoint odd cycles (Q2118145) (← links)
- An extreme function which is nonnegative and discontinuous everywhere (Q2288200) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- The structure of the infinite models in integer programming (Q2401145) (← links)
- Balanced matrices (Q2433704) (← links)
- Cutting planes from two-term disjunctions (Q2450685) (← links)
- Disjunctive programming and relaxations of polyhedra (Q2452382) (← links)
- Perfect matchings in balanced hypergraphs (Q2563509) (← links)
- Recognizing balanceable matrices (Q2583120) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
