Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. - Michele Conforti; Gérard Cornuéjols (Discret. Appl. Math., 1984)

Ki-covers I: Complexity and polytopes. - Michele Conforti; Derek G. Corneil; Ali Ridha Mahjoub (Discret. Math., 1986)

A construction for binary matroids. - Francisco Barahona; Michele Conforti (Discret. Math., 1987)

Ki-covers. II. Ki-perfect graphs. - Michele Conforti; Derek Gordon Corneil; Ali Ridha Mahjoub (J. Graph Theory, 1987)

Some New Matroids on Graphs: Cut Sets and the Max Cut Problem. - Michele Conforti; M. R. Rao (Math. Oper. Res., 1987)

Structural properties and recognition of restricted and strongly unimodular matrices. - Michele Conforti; M. R. Rao (Math. Program., 1987)

An algorithmic framework for the matching problem in some hypergraphs. - Michele Conforti; Gérard Cornuéjols (Networks, 1987)

A characterization of matroidal systems of inequalities. - Michele Conforti; Monique Laurent (Discret. Math., 1988)

On the Facial Structure of Independence System Polyhedra. - Michele Conforti; Monique Laurent (Math. Oper. Res., 1988)

On the geometric structure of independence systems. - Michele Conforti; Monique Laurent (Math. Program., 1989)

Odd cycles and matrices with integrality properties. - Michele Conforti; M. R. Rao (Math. Program., 1989)

A Decomposition Theorem for Balanced Matrices. - Michele Conforti; Gérard Cornuéjols (IPCO, 1990)

The equipartition polytope. I: Formulations, dimension and basic facets. - Michele Conforti; M. R. Rao; Antonio Sassano (Math. Program., 1991)

The equipartition polytope. II: Valid inequalities and facets. - Michele Conforti; M. R. Rao; Antonio Sassano (Math. Program., 1991)

Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets. - Michele Conforti; M. R. Rao (Discret. Math., 1992)

Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations. - Michele Conforti; M. R. Rao (Discret. Math., 1992)

Properties of balanced and perfect matrices. - Michele Conforti; M. R. Rao (Math. Program., 1992)

Structural properties and decomposition of linear balanced matrices. - Michele Conforti; M. R. Rao (Math. Program., 1992)

Testing balancedness and perfection of linear matrices. - Michele Conforti; M. R. Rao (Math. Program., 1993)

Recognizing Balanced 0, +/- Matrices. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (SODA, 1994)

From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes. - Michele Conforti; Gérard Cornuéjols; Klaus Truemper (Math. Oper. Res., 1994)

A Mickey-Mouse Decomposition Theorem. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (IPCO, 1995)

Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. - Michele Conforti; Gérard Cornuéjols; M. R. Rao (Discret. Appl. Math., 1995)

A Class of Logic Problems Solvable by Linear Programming. - Michele Conforti; Gérard Cornuéjols (J. ACM, 1995)

Balanced 0, +-1-matrixces, bicoloring and total dual integrality. - Michele Conforti; Gérard Cornuéjols (Math. Program., 1995)

Perfect Matchings in Balanced Hypergraphs. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (Comb., 1996)

Packing T-joins. - Paolo Codato; Michele Conforti; Claudia Serafini (J. Graph Theory, 1996)

Finding an Even Hole in a Graph. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (FOCS, 1997)

Universally Signable Graphs. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (Comb., 1997)

A branch-and-cut algorithm for the equicut problem. - Lorenzo Brunetta; Michele Conforti; Giovanni Rinaldi (Math. Program., 1997)

A Theorem of Truemper. - Michele Conforti; Ajai Kapoor (IPCO, 1998)

Balanced cycles and holes in bipartite graphs. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (Discret. Math., 1999)

Decomposition of Balanced Matrices. - Michele Conforti; Gérard Cornuéjols; M. R. Rao (J. Comb. Theory B, 1999)

Even and odd holes in cap-free graphs. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 1999)

A Theorem of Truemper. - Michele Conforti; Bert Gerards; Ajai Kapoor (Comb., 2000)

A polyhedral approach to an integer multicommodity flow problem. - Lorenzo Brunetta; Michele Conforti; Matteo Fischetti (Discret. Appl. Math., 2000)

Triangle-free graphs that are signable without even holes. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 2000)

Shortest paths in conservative graphs. - Michele Conforti; Romeo Rizzi (Discret. Math., 2001)

Perfect, ideal and balanced matrices. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (Eur. J. Oper. Res., 2001)

Balanced 0-1 Matrices I. Decomposition. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Comb. Theory B, 2001)

Balanced 0-1 Matrices II. Recognition Algorithm. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Comb. Theory B, 2001)

Perfect Graphs, Partitionable Graphs and Cutsets. - Michele Conforti; Gérard Cornuéjols; Grigor Gasparyan; Kristina Vuskovic (Comb., 2002)

Even-hole-free graphs part II: Recognition algorithm. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 2002)

Even-hole-free graphs part I: Decomposition theorem. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 2002)

Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. - Michele Conforti; Gérard Cornuéjols (J. Comb. Theory B, 2003)

Reconstructing edge-disjoint paths. - Michele Conforti; Refael Hassin; R. Ravi 001 (Oper. Res. Lett., 2003)

Bicolorings and Equitable Bicolorings of Matrices. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (The Sharpest Cut, 2004)

Edge-Connectivity Augmentation and Network Matrices. - Michele Conforti; Anna Galluccio; Guido Proietti (WG, 2004)

Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (Discret. Appl. Math., 2004)

On the cut polyhedron. - Michele Conforti; Giovanni Rinaldi; Laurence A. Wolsey (Discret. Math., 2004)

Square-free perfect graphs. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (J. Comb. Theory B, 2004)

Disjoint paths in arborescences. - Livio Colussi; Michele Conforti; Giacomo Zambelli (Discret. Math., 2005)

Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Comb., 2006)

Balanced matrices. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (Discret. Math., 2006)

Recognizing Balanceable Matrices. - Michele Conforti; Giacomo Zambelli (Math. Program., 2006)

Odd Hole Recognition in Graphs of Bounded Clique Size. - Michele Conforti; Gérard Cornuéjols; Xinming Liu; Kristina Vuskovic; Giacomo Zambelli (SIAM J. Discret. Math., 2006)

Mixed-Integer Vertex Covers on Bipartite Graphs. - Michele Conforti; Bert Gerards; Giacomo Zambelli (IPCO, 2007)

The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. - Michele Conforti; Marco Di Summa; Laurence A. Wolsey (IPCO, 2007)

Minimally Infeasible Set-Partitioning Problems with Balanced Constraints. - Michele Conforti; Marco Di Summa; Giacomo Zambelli (Math. Oper. Res., 2007)

Packing Odd Circuits. - Michele Conforti; Bert Gerards (SIAM J. Discret. Math., 2007)

The Mixing Set with Flows. - Michele Conforti; Marco Di Summa; Laurence A. Wolsey (SIAM J. Discret. Math., 2007)

The Mixing Set with Divisible Capacities. - Michele Conforti; Marco Di Summa; Laurence A. Wolsey (IPCO, 2008)

Compact formulations as a union of polyhedra. - Michele Conforti; Laurence A. Wolsey (Math. Program., 2008)

Network Formulations of Mixed-Integer Programs. - Michele Conforti; Marco Di Summa; Friedrich Eisenbrand; Laurence A. Wolsey (Math. Oper. Res., 2009)

The mixing set with divisible capacities: A simple approach. - Michele Conforti; Giacomo Zambelli (Oper. Res. Lett., 2009)

Polyhedral Approaches to Mixed Integer Linear Programming. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (50 Years of Integer Programming, 2010)

On Lifting Integer Variables in Minimal Inequalities. - Amitabh Basu; Manoel B. Campêlo; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (IPCO, 2010)

Extended formulations in combinatorial optimization. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (4OR, 2010)

Maximal Lattice-Free Convex Sets in Linear Subspaces. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Math. Oper. Res., 2010)

Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. - Michele Conforti; Laurence A. Wolsey; Giacomo Zambelli (Math. Oper. Res., 2010)

Equivalence between intersection cuts and the corner polyhedron. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Oper. Res. Lett., 2010)

Minimal Inequalities for an Infinite Relaxation of Integer Programs. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (SIAM J. Discret. Math., 2010)

A Geometric Perspective on Lifting. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Oper. Res., 2011)

A counterexample to a conjecture of Gomory and Johnson. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Math. Program., 2012)

Cut-Generating Functions. - Michele Conforti; Gérard Cornuéjols; Aris Daniilidis; Claude Lemaréchal; Jérôme Malick (IPCO, 2013)

Unique lifting of integer variables in minimal inequalities. - Amitabh Basu; Manoel B. Campêlo; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Math. Program., 2013)

Cutting planes from two-term disjunctions. - Pierre Bonami; Michele Conforti; Gérard Cornuéjols; Marco Molinaro 001; Giacomo Zambelli (Oper. Res. Lett., 2013)

On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. - Gennadiy Averkov; Michele Conforti; Alberto Del Pia; Marco Di Summa; Yuri Faenza (SIAM J. Discret. Math., 2013)

Disjunctive programming and relaxations of polyhedra. - Michele Conforti; Alberto Del Pia (Math. Program., 2014)

Cut-Generating Functions and S-Free Sets. - Michele Conforti; Gérard Cornuéjols; Aris Daniilidis; Claude Lemaréchal; Jérôme Malick (Math. Oper. Res., 2015)

A geometric approach to cut-generating functions. - Amitabh Basu; Michele Conforti; Marco Di Summa (Math. Program., 2015)

Stable sets and graphs with no even holes. - Michele Conforti; Bert Gerards; Kanstantsin Pashkovich (Math. Program., 2015)

Reverse split rank. - Michele Conforti; Alberto Del Pia; Marco Di Summa; Yuri Faenza (Math. Program., 2015)

Subgraph polytopes and independence polytopes of count matroids. - Michele Conforti; Volker Kaibel; Matthias Walter; Stefan Weltge (Oper. Res. Lett., 2015)

Reverse Chvátal-Gomory Rank. - Michele Conforti; Alberto Del Pia; Marco Di Summa; Yuri Faenza; Roland Grappe (SIAM J. Discret. Math., 2015)

The projected faces property and polyhedral relations. - Michele Conforti; Kanstantsin Pashkovich (Math. Program., 2016)

Cut Dominants and Forbidden Minors. - Michele Conforti; Samuel Fiorini; Kanstantsin Pashkovich (SIAM J. Discret. Math., 2016)

Maximal S-Free Convex Sets and the Helly Number. - Michele Conforti; Marco Di Summa (SIAM J. Discret. Math., 2016)

Optimality certificates for convex minimization and Helly numbers. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Robert Weismantel; Stefan Weltge (Oper. Res. Lett., 2017)

Extreme functions with an arbitrary number of slopes. - Amitabh Basu; Michele Conforti; Marco Di Summa; Joseph Paat (Math. Program., 2018)

The Structure of the Infinite Models in Integer Programming. - Amitabh Basu; Michele Conforti; Marco Di Summa; Joseph Paat (Math. Oper. Res., 2019)

Optimal Cutting Planes from the Group Relaxations. - Amitabh Basu; Michele Conforti; Marco Di Summa; Giacomo Zambelli (Math. Oper. Res., 2019)

"Facet" separation with one linear program. - Michele Conforti; Laurence A. Wolsey (Math. Program., 2019)

The stable set problem in graphs with bounded genus and bounded odd cycle packing number. - Michele Conforti; Samuel Fiorini; Tony Huynh; Gwenaël Joret; Stefan Weltge (SODA, 2020)

Recognizing Cartesian products of matrices and polytopes. - Manuel Aprile; Michele Conforti; Yuri Faenza; Samuel Fiorini; Tony Huynh; Marco Macchia (CoRR, 2020)

Complexity of cutting planes and branch-and-bound in mixed-integer optimization. - Amitabh Basu; Michele Conforti; Marco Di Summa; Hongyi Jiang (CoRR, 2020)

An extreme function which is nonnegative and discontinuous everywhere. - Amitabh Basu; Michele Conforti; Marco Di Summa (Math. Program., 2020)

Balas formulation for the union of polytopes is optimal. - Michele Conforti; Marco Di Summa; Yuri Faenza (Math. Program., 2020)

Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective. - Michele Conforti; Marianna De Santis; Marco Di Summa; Francesco Rinaldi (4OR, 2021)

Helly systems and certificates in optimization. - Amitabh Basu; Tongtong Chen; Michele Conforti; Hongyi Jiang (CoRR, 2021)

Split Cuts in the Plane. - Amitabh Basu; Michele Conforti; Marco Di Summa; Hongyi Jiang (SIAM J. Optim., 2021)

Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. - Michele Conforti; Samuel Fiorini; Tony Huynh; Stefan Weltge (Math. Program., 2022)

Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. - Amitabh Basu; Michele Conforti; Marco Di Summa; Hongyi Jiang (Comb., 2022)

Complexity of branch-and-bound and cutting planes in mixed-integer optimization. - Amitabh Basu; Michele Conforti; Marco Di Summa; Hongyi Jiang (Math. Program., 2023)

Slack matrices, k-products, and 2-level polytopes. - Manuel Aprile; Michele Conforti; Samuel Fiorini; Yuri Faenza; Tony Huynh; Marco Macchia (Discret. Appl. Math., 2024)

Binary Extended Formulations and Sequential Convexification. - Manuel Aprile; Michele Conforti; Marco Di Summa (Math. Oper. Res., 2024)

Steiner Cut Dominants. - Michele Conforti; Volker Kaibel (Math. Oper. Res., 2025)