Michele Conforti

121 papers A* 4B 15Journal 100

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Steiner Cut Dominants. Math. Oper. Res. Michele Conforti, Volker Kaibel
2024	J	`jnl`	Binary Extended Formulations and Sequential Convexification. Math. Oper. Res. Manuel Aprile, Michele Conforti, Marco Di Summa
2024	J	`jnl`	Slack matrices, k-products, and 2-level polytopes. Discret. Appl. Math. Manuel Aprile, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia
2023	J	`jnl`	Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Math. Program. Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
2022	J	`jnl`	Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. Comb. Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
2022	J	`jnl`	Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. Math. Program. Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge
2021	J	`jnl`	Binary extended formulations and sequential convexification. CoRR Manuel Aprile, Michele Conforti, Marco Di Summa
2021	B	`conf`	Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. IPCO Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
2021	J	`jnl`	Helly systems and certificates in optimization. CoRR Amitabh Basu, Tongtong Chen, Michele Conforti, Hongyi Jiang
2021	J	`jnl`	Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective. 4OR Michele Conforti, Marianna De Santis, Marco Di Summa, Francesco Rinaldi
2021	J	`jnl`	Slack matrices, k-products, and 2-level polytopes. CoRR Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
2021	J	`jnl`	Split Cuts in the Plane. SIAM J. Optim. Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
2020	J	`jnl`	An extreme function which is nonnegative and discontinuous everywhere. Math. Program. Amitabh Basu, Michele Conforti, Marco Di Summa
2020	J	`jnl`	Balas formulation for the union of polytopes is optimal. Math. Program. Michele Conforti, Marco Di Summa, Yuri Faenza
2020	J	`jnl`	Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II. CoRR Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
2020	J	`jnl`	Complexity of cutting planes and branch-and-bound in mixed-integer optimization. CoRR Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
2020	B	`conf`	Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. IPCO Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge
2020	J	`jnl`	Recognizing Cartesian products of matrices and polytopes. CoRR Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
2020	A*	`conf`	The stable set problem in graphs with bounded genus and bounded odd cycle packing number. SODA Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge
2019	J	`jnl`	"Facet" separation with one linear program. Math. Program. Michele Conforti, Laurence A. Wolsey
2019	J	`jnl`	Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. CoRR Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge
2019	J	`jnl`	Optimal Cutting Planes from the Group Relaxations. Math. Oper. Res. Amitabh Basu, Michele Conforti, Marco Di Summa, Giacomo Zambelli
2019	J	`jnl`	The Structure of the Infinite Models in Integer Programming. Math. Oper. Res. Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
2019	J	`jnl`	The stable set problem in graphs with bounded genus and bounded odd cycle packing number. CoRR Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge
2018	J	`jnl`	Extreme functions with an arbitrary number of slopes. Math. Program. Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
2017	J	`jnl`	Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Robert Weismantel, Stefan Weltge
2017	B	`conf`	The Structure of the Infinite Models in Integer Programming. IPCO Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
2016	J	`jnl`	Cut Dominants and Forbidden Minors. SIAM J. Discret. Math. Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich
2016	B	`conf`	Extreme Functions with an Arbitrary Number of Slopes. IPCO Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
2016	J	`jnl`	Maximal S-Free Convex Sets and the Helly Number. SIAM J. Discret. Math. Michele Conforti, Marco Di Summa
2016	J	`jnl`	The projected faces property and polyhedral relations. Math. Program. Michele Conforti, Kanstantsin Pashkovich
2015	J	`jnl`	A geometric approach to cut-generating functions. Math. Program. Amitabh Basu, Michele Conforti, Marco Di Summa
2015	J	`jnl`	Cut-Generating Functions and Math. Oper. Res. Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick
2015	J	`jnl`	Reverse Chvátal-Gomory Rank. SIAM J. Discret. Math. Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
2015	J	`jnl`	Reverse split rank. Math. Program. Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
2015	J	`jnl`	Stable sets and graphs with no even holes. Math. Program. Michele Conforti, Bert Gerards, Kanstantsin Pashkovich
2015	J	`jnl`	Subgraph Polytopes and Independence Polytopes of Count Matroids. CoRR Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge
2015	J	`jnl`	Subgraph polytopes and independence polytopes of count matroids. Oper. Res. Lett. Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge
2014	J	`jnl`	Disjunctive programming and relaxations of polyhedra. Math. Program. Michele Conforti, Alberto Del Pia
2014	B	`conf`	Reverse Split Rank. IPCO Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
2014	J	`jnl`	Reverse Split Rank. CoRR Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
2013	B	`conf`	Cut-Generating Functions. IPCO Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick
2013	J	`jnl`	Cutting planes from two-term disjunctions. Oper. Res. Lett. Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli
2013	J	`jnl`	Extended formulations in combinatorial optimization. Ann. Oper. Res. Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2013	J	`jnl`	On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. SIAM J. Discret. Math. Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
2013	B	`conf`	Reverse Chvátal-Gomory Rank. IPCO Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
2013	J	`jnl`	Unique lifting of integer variables in minimal inequalities. Math. Program. Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2012	J	`jnl`	A counterexample to a conjecture of Gomory and Johnson. Math. Program. Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2011	J	`jnl`	A Geometric Perspective on Lifting. Oper. Res. Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010	J	`jnl`	Equivalence between intersection cuts and the corner polyhedron. Oper. Res. Lett. Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010	J	`jnl`	Extended formulations in combinatorial optimization. 4OR Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010	J	`jnl`	Maximal Lattice-Free Convex Sets in Linear Subspaces. Math. Oper. Res. Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010	J	`jnl`	Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM J. Discret. Math. Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010	B	`conf`	On Lifting Integer Variables in Minimal Inequalities. IPCO Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010	—	`ch.`	Polyhedral Approaches to Mixed Integer Linear Programming. 50 Years of Integer Programming Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010	J	`jnl`	Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. Math. Oper. Res. Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli
2009	J	`jnl`	Network Formulations of Mixed-Integer Programs. Math. Oper. Res. Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey
2009	J	`jnl`	The mixing set with divisible capacities: A simple approach. Oper. Res. Lett. Michele Conforti, Giacomo Zambelli
2008	J	`jnl`	Compact formulations as a union of polyhedra. Math. Program. Michele Conforti, Laurence A. Wolsey
2008	B	`conf`	The Mixing Set with Divisible Capacities. IPCO Michele Conforti, Marco Di Summa, Laurence A. Wolsey
2007	J	`jnl`	Minimally Infeasible Set-Partitioning Problems with Balanced Constraints. Math. Oper. Res. Michele Conforti, Marco Di Summa, Giacomo Zambelli
2007	B	`conf`	Mixed-Integer Vertex Covers on Bipartite Graphs. IPCO Michele Conforti, Bert Gerards, Giacomo Zambelli
2007	J	`jnl`	Packing Odd Circuits. SIAM J. Discret. Math. Michele Conforti, Bert Gerards
2007	B	`conf`	The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO Michele Conforti, Marco Di Summa, Laurence A. Wolsey
2007	J	`jnl`	The Mixing Set with Flows. SIAM J. Discret. Math. Michele Conforti, Marco Di Summa, Laurence A. Wolsey
2006	J	`jnl`	Balanced matrices. Discret. Math. Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
2006	J	`jnl`	Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. Comb. Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2006	J	`jnl`	Odd Hole Recognition in Graphs of Bounded Clique Size. SIAM J. Discret. Math. Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli
2006	J	`jnl`	Recognizing Balanceable Matrices. Math. Program. Michele Conforti, Giacomo Zambelli
2005	J	`jnl`	Disjoint paths in arborescences. Discret. Math. Livio Colussi, Michele Conforti, Giacomo Zambelli
2004	—	`ch.`	Bicolorings and Equitable Bicolorings of Matrices. The Sharpest Cut Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2004	J	`jnl`	Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. Discret. Appl. Math. Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
2004	B	`conf`	Edge-Connectivity Augmentation and Network Matrices. WG Michele Conforti, Anna Galluccio, Guido Proietti
2004	J	`jnl`	On the cut polyhedron. Discret. Math. Michele Conforti, Giovanni Rinaldi, Laurence A. Wolsey
2004	J	`jnl`	Square-free perfect graphs. J. Comb. Theory B Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
2003	J	`jnl`	Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. J. Comb. Theory B Michele Conforti, Gérard Cornuéjols
2003	J	`jnl`	Reconstructing edge-disjoint paths. Oper. Res. Lett. Michele Conforti, Refael Hassin, R. Ravi
2002	J	`jnl`	Even-hole-free graphs part I: Decomposition theorem. J. Graph Theory Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
2002	J	`jnl`	Even-hole-free graphs part II: Recognition algorithm. J. Graph Theory Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
2002	J	`jnl`	Perfect Graphs, Partitionable Graphs and Cutsets. Comb. Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic
2001	J	`jnl`	Balanced 0-1 Matrices I. Decomposition. J. Comb. Theory B Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
2001	J	`jnl`	Balanced 0-1 Matrices II. Recognition Algorithm. J. Comb. Theory B Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
2001	J	`jnl`	Perfect, ideal and balanced matrices. Eur. J. Oper. Res. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
2001	J	`jnl`	Shortest paths in conservative graphs. Discret. Math. Michele Conforti, Romeo Rizzi
2000	J	`jnl`	A Theorem of Truemper. Comb. Michele Conforti, Bert Gerards, Ajai Kapoor
2000	J	`jnl`	A polyhedral approach to an integer multicommodity flow problem. Discret. Appl. Math. Lorenzo Brunetta, Michele Conforti, Matteo Fischetti
2000	J	`jnl`	Triangle-free graphs that are signable without even holes. J. Graph Theory Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1999	J	`jnl`	Balanced cycles and holes in bipartite graphs. Discret. Math. Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
1999	J	`jnl`	Decomposition of Balanced Matrices. J. Comb. Theory B Michele Conforti, Gérard Cornuéjols, M. R. Rao
1999	J	`jnl`	Even and odd holes in cap-free graphs. J. Graph Theory Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1998	B	`conf`	A Theorem of Truemper. IPCO Michele Conforti, Ajai Kapoor
1997	J	`jnl`	A branch-and-cut algorithm for the equicut problem. Math. Program. Lorenzo Brunetta, Michele Conforti, Giovanni Rinaldi
1997	A*	`conf`	Finding an Even Hole in a Graph. FOCS Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1997	J	`jnl`	Universally Signable Graphs. Comb. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1996	J	`jnl`	Packing J. Graph Theory Paolo Codato, Michele Conforti, Claudia Serafini
1996	J	`jnl`	Perfect Matchings in Balanced Hypergraphs. Comb. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1995	J	`jnl`	A Class of Logic Problems Solvable by Linear Programming. J. ACM Michele Conforti, Gérard Cornuéjols
1995	B	`conf`	A Mickey-Mouse Decomposition Theorem. IPCO Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1995	J	`jnl`	Balanced 0, +-1-matrixces, bicoloring and total dual integrality. Math. Program. Michele Conforti, Gérard Cornuéjols
1995	J	`jnl`	Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. Discret. Appl. Math. Michele Conforti, Gérard Cornuéjols, M. R. Rao
1994	J	`jnl`	From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes. Math. Oper. Res. Michele Conforti, Gérard Cornuéjols, Klaus Truemper
1994	A*	`conf`	Recognizing Balanced 0, +/- Matrices. SODA Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1993	J	`jnl`	Testing balancedness and perfection of linear matrices. Math. Program. Michele Conforti, M. R. Rao
1992	A*	`conf`	A Class of Logic Problems Solvable by Linear Programming FOCS Michele Conforti, Gérard Cornuéjols
1992	J	`jnl`	Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets. Discret. Math. Michele Conforti, M. R. Rao
1992	J	`jnl`	Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations. Discret. Math. Michele Conforti, M. R. Rao
1992	J	`jnl`	Properties of balanced and perfect matrices. Math. Program. Michele Conforti, M. R. Rao
1992	J	`jnl`	Structural properties and decomposition of linear balanced matrices. Math. Program. Michele Conforti, M. R. Rao
1991	J	`jnl`	The equipartition polytope. I: Formulations, dimension and basic facets. Math. Program. Michele Conforti, M. R. Rao, Antonio Sassano
1991	J	`jnl`	The equipartition polytope. II: Valid inequalities and facets. Math. Program. Michele Conforti, M. R. Rao, Antonio Sassano
1990	B	`conf`	A Decomposition Theorem for Balanced Matrices. IPCO Michele Conforti, Gérard Cornuéjols
1989	J	`jnl`	Odd cycles and matrices with integrality properties. Math. Program. Michele Conforti, M. R. Rao
1989	J	`jnl`	On the geometric structure of independence systems. Math. Program. Michele Conforti, Monique Laurent
1988	J	`jnl`	A characterization of matroidal systems of inequalities. Discret. Math. Michele Conforti, Monique Laurent
1988	J	`jnl`	On the Facial Structure of Independence System Polyhedra. Math. Oper. Res. Michele Conforti, Monique Laurent
1987	J	`jnl`	A construction for binary matroids. Discret. Math. Francisco Barahona, Michele Conforti
1987	J	`jnl`	An algorithmic framework for the matching problem in some hypergraphs. Networks Michele Conforti, Gérard Cornuéjols
1987	J	`jnl`	Some New Matroids on Graphs: Cut Sets and the Max Cut Problem. Math. Oper. Res. Michele Conforti, M. R. Rao
1987	J	`jnl`	Structural properties and recognition of restricted and strongly unimodular matrices. Math. Program. Michele Conforti, M. R. Rao
1986	J	`jnl`	K Discret. Math. Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub
1984	J	`jnl`	Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discret. Appl. Math. Michele Conforti, Gérard Cornuéjols