Michele Conforti

ORCID

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 29

Top Venues

Publications

Manuel Aprile, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia
Slack matrices, k-products, and 2-level polytopes. Discret. Appl. Math. 354 (2024)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Math. Program. 198 (1) (2023)
Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. Math. Program. 192 (1) (2022)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. Comb. 42 (6) (2022)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. IPCO (2021)
Michele Conforti, Marianna De Santis, Marco Di Summa, Francesco Rinaldi
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective. 4OR 19 (4) (2021)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Split Cuts in the Plane. SIAM J. Optim. 31 (1) (2021)
Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
Slack matrices, k-products, and 2-level polytopes. CoRR (2021)
Amitabh Basu, Tongtong Chen, Michele Conforti, Hongyi Jiang
Helly systems and certificates in optimization. CoRR (2021)
Manuel Aprile, Michele Conforti, Marco Di Summa
Binary extended formulations and sequential convexification. CoRR (2021)
Amitabh Basu, Michele Conforti, Marco Di Summa
An extreme function which is nonnegative and discontinuous everywhere. Math. Program. 179 (1) (2020)
Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. IPCO (2020)
Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
Recognizing Cartesian products of matrices and polytopes. CoRR (2020)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II. CoRR (2020)
Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. SODA (2020)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of cutting planes and branch-and-bound in mixed-integer optimization. CoRR (2020)
Michele Conforti, Marco Di Summa, Yuri Faenza
Balas formulation for the union of polytopes is optimal. Math. Program. 180 (1) (2020)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
The Structure of the Infinite Models in Integer Programming. Math. Oper. Res. 44 (4) (2019)
Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. CoRR (2019)
Michele Conforti, Laurence A. Wolsey
"Facet" separation with one linear program. Math. Program. 178 (1-2) (2019)
Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. CoRR (2019)
Amitabh Basu, Michele Conforti, Marco Di Summa, Giacomo Zambelli
Optimal Cutting Planes from the Group Relaxations. Math. Oper. Res. 44 (4) (2019)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
Extreme functions with an arbitrary number of slopes. Math. Program. 172 (1-2) (2018)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
The Structure of the Infinite Models in Integer Programming. IPCO (2017)
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Robert Weismantel, Stefan Weltge
Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. 45 (6) (2017)
Michele Conforti, Kanstantsin Pashkovich
The projected faces property and polyhedral relations. Math. Program. 156 (1-2) (2016)
Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich
Cut Dominants and Forbidden Minors. SIAM J. Discret. Math. 30 (3) (2016)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
Extreme Functions with an Arbitrary Number of Slopes. IPCO (2016)
Michele Conforti, Marco Di Summa
Maximal S-Free Convex Sets and the Helly Number. SIAM J. Discret. Math. 30 (4) (2016)
Amitabh Basu, Michele Conforti, Marco Di Summa
A geometric approach to cut-generating functions. Math. Program. 151 (1) (2015)
Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick
-Free Sets. Math. Oper. Res. 40 (2) (2015)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
Reverse Chvátal-Gomory Rank. SIAM J. Discret. Math. 29 (1) (2015)
Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge
Subgraph polytopes and independence polytopes of count matroids. Oper. Res. Lett. 43 (5) (2015)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
Reverse split rank. Math. Program. 154 (1-2) (2015)
Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge
Subgraph Polytopes and Independence Polytopes of Count Matroids. CoRR (2015)
Michele Conforti, Bert Gerards, Kanstantsin Pashkovich
Stable sets and graphs with no even holes. Math. Program. 153 (1) (2015)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
Reverse Split Rank. CoRR (2014)
Michele Conforti, Alberto Del Pia
Disjunctive programming and relaxations of polyhedra. Math. Program. 144 (1-2) (2014)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
Reverse Split Rank. IPCO (2014)
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Unique lifting of integer variables in minimal inequalities. Math. Program. 141 (1-2) (2013)
Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick
Cut-Generating Functions. IPCO (2013)
Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. SIAM J. Discret. Math. 27 (3) (2013)
Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli
Cutting planes from two-term disjunctions. Oper. Res. Lett. 41 (5) (2013)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
Reverse Chvátal-Gomory Rank. IPCO (2013)
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Extended formulations in combinatorial optimization. Ann. Oper. Res. 204 (1) (2013)
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
A counterexample to a conjecture of Gomory and Johnson. Math. Program. 133 (1-2) (2012)
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
A Geometric Perspective on Lifting. Oper. Res. 59 (3) (2011)
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Equivalence between intersection cuts and the corner polyhedron. Oper. Res. Lett. 38 (3) (2010)
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Extended formulations in combinatorial optimization. 4OR 8 (1) (2010)
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Maximal Lattice-Free Convex Sets in Linear Subspaces. Math. Oper. Res. 35 (3) (2010)
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
On Lifting Integer Variables in Minimal Inequalities. IPCO (2010)
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM J. Discret. Math. 24 (1) (2010)
Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. Math. Oper. Res. 35 (3) (2010)
Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey
Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34 (1) (2009)
Michele Conforti, Giacomo Zambelli
The mixing set with divisible capacities: A simple approach. Oper. Res. Lett. 37 (6) (2009)
Michele Conforti, Laurence A. Wolsey
Compact formulations as a union of polyhedra. Math. Program. 114 (2) (2008)
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
The Mixing Set with Divisible Capacities. IPCO (2008)
Michele Conforti, Bert Gerards
Packing Odd Circuits. SIAM J. Discret. Math. 21 (2) (2007)
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
The Mixing Set with Flows. SIAM J. Discret. Math. 21 (2) (2007)
Michele Conforti, Bert Gerards, Giacomo Zambelli
Mixed-Integer Vertex Covers on Bipartite Graphs. IPCO (2007)
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO (2007)
Michele Conforti, Marco Di Summa, Giacomo Zambelli
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints. Math. Oper. Res. 32 (3) (2007)
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. Comb. 26 (5) (2006)
Michele Conforti, Giacomo Zambelli
Recognizing Balanceable Matrices. Math. Program. 105 (2-3) (2006)
Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli
Odd Hole Recognition in Graphs of Bounded Clique Size. SIAM J. Discret. Math. 20 (1) (2006)
Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
Balanced matrices. Discret. Math. 306 (19-20) (2006)
Livio Colussi, Michele Conforti, Giacomo Zambelli
Disjoint paths in arborescences. Discret. Math. 292 (1-3) (2005)
Michele Conforti, Anna Galluccio, Guido Proietti
Edge-Connectivity Augmentation and Network Matrices. WG (2004)
Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
Square-free perfect graphs. J. Comb. Theory, Ser. B 90 (2) (2004)
Michele Conforti, Giovanni Rinaldi, Laurence A. Wolsey
On the cut polyhedron. Discret. Math. 277 (1-3) (2004)
Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. Discret. Appl. Math. 141 (1-3) (2004)
Michele Conforti, Gérard Cornuéjols
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. J. Comb. Theory, Ser. B 87 (2) (2003)
Michele Conforti, Refael Hassin, R. Ravi
Reconstructing edge-disjoint paths. Oper. Res. Lett. 31 (3) (2003)
Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic
Perfect Graphs, Partitionable Graphs and Cutsets. Comb. 22 (1) (2002)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Even-hole-free graphs part I: Decomposition theorem. J. Graph Theory 39 (1) (2002)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Even-hole-free graphs part II: Recognition algorithm. J. Graph Theory 40 (4) (2002)
Michele Conforti, Romeo Rizzi
Shortest paths in conservative graphs. Discret. Math. 226 (1-3) (2001)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Balanced 0-1 Matrices II. Recognition Algorithm. J. Comb. Theory, Ser. B 81 (2) (2001)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Perfect, ideal and balanced matrices. Eur. J. Oper. Res. 133 (3) (2001)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Balanced 0-1 Matrices I. Decomposition. J. Comb. Theory, Ser. B 81 (2) (2001)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Triangle-free graphs that are signable without even holes. J. Graph Theory 34 (3) (2000)
Lorenzo Brunetta, Michele Conforti, Matteo Fischetti
A polyhedral approach to an integer multicommodity flow problem. Discret. Appl. Math. 101 (1-3) (2000)
Michele Conforti, Bert Gerards, Ajai Kapoor
A Theorem of Truemper. Comb. 20 (1) (2000)
Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
Balanced cycles and holes in bipartite graphs. Discret. Math. 199 (1-3) (1999)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Even and odd holes in cap-free graphs. J. Graph Theory 30 (4) (1999)
Michele Conforti, Gérard Cornuéjols, M. R. Rao
Decomposition of Balanced Matrices. J. Comb. Theory, Ser. B 77 (2) (1999)
Michele Conforti, Ajai Kapoor
A Theorem of Truemper. IPCO (1998)
Lorenzo Brunetta, Michele Conforti, Giovanni Rinaldi
A branch-and-cut algorithm for the equicut problem. Math. Program. 77 (1997)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Universally Signable Graphs. Comb. 17 (1) (1997)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Finding an Even Hole in a Graph. FOCS (1997)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Perfect Matchings in Balanced Hypergraphs. Comb. 16 (3) (1996)
Paolo Codato, Michele Conforti, Claudia Serafini
-joins. J. Graph Theory 22 (4) (1996)
Michele Conforti, Gérard Cornuéjols, M. R. Rao
Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. Discret. Appl. Math. 62 (1-3) (1995)
Michele Conforti, Gérard Cornuéjols
A Class of Logic Problems Solvable by Linear Programming. J. ACM 42 (5) (1995)
Michele Conforti, Gérard Cornuéjols
Balanced 0, +-1-matrixces, bicoloring and total dual integrality. Math. Program. 71 (1995)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
A Mickey-Mouse Decomposition Theorem. IPCO (1995)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Recognizing Balanced 0, +/- Matrices. SODA (1994)
Michele Conforti, Gérard Cornuéjols, Klaus Truemper
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes. Math. Oper. Res. 19 (1) (1994)
Michele Conforti, M. R. Rao
Testing balancedness and perfection of linear matrices. Math. Program. 61 (1993)
Michele Conforti, M. R. Rao
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets. Discret. Math. 104 (1) (1992)

Michele Conforti.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michele Conforti