According to our database
1,
Michele Conforti
authored at least 106 papers
between 1984 and 2023.
Collaborative distances:
2023
Complexity of branch-and-bound and cutting planes in mixed-integer optimization.
Math. Program., March, 2023
2022
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II.
Comb., December, 2022
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles.
Math. Program., 2022
2021
Helly systems and certificates in optimization.
CoRR, 2021
Slack matrices, k-products, and 2-level polytopes.
CoRR, 2021
Binary extended formulations and sequential convexification.
CoRR, 2021
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective.
4OR, 2021
2020
Balas formulation for the union of polytopes is optimal.
Math. Program., 2020
An extreme function which is nonnegative and discontinuous everywhere.
Math. Program., 2020
Complexity of cutting planes and branch-and-bound in mixed-integer optimization.
CoRR, 2020
Recognizing Cartesian products of matrices and polytopes.
CoRR, 2020
The stable set problem in graphs with bounded genus and bounded odd cycle packing number.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
"Facet" separation with one linear program.
Math. Program., 2019
Optimal Cutting Planes from the Group Relaxations.
Math. Oper. Res., 2019
The Structure of the Infinite Models in Integer Programming.
Math. Oper. Res., 2019
2018
Extreme functions with an arbitrary number of slopes.
Math. Program., 2018
2017
Optimality certificates for convex minimization and Helly numbers.
Oper. Res. Lett., 2017
2016
Maximal S-Free Convex Sets and the Helly Number.
SIAM J. Discret. Math., 2016
Cut Dominants and Forbidden Minors.
SIAM J. Discret. Math., 2016
The projected faces property and polyhedral relations.
Math. Program., 2016
2015
Reverse Chvátal-Gomory Rank.
SIAM J. Discret. Math., 2015
Subgraph polytopes and independence polytopes of count matroids.
Oper. Res. Lett., 2015
Stable sets and graphs with no even holes.
Math. Program., 2015
A geometric approach to cut-generating functions.
Math. Program., 2015
Cut-Generating Functions and <i>S</i>-Free Sets.
Math. Oper. Res., 2015
2014
Disjunctive programming and relaxations of polyhedra.
Math. Program., 2014
2013
On the Convergence of the Affine Hull of the Chvátal-Gomory Closures.
SIAM J. Discret. Math., 2013
Cutting planes from two-term disjunctions.
Oper. Res. Lett., 2013
Unique lifting of integer variables in minimal inequalities.
Math. Program., 2013
Extended formulations in combinatorial optimization.
Ann. Oper. Res., 2013
Cut-Generating Functions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013
2012
A counterexample to a conjecture of Gomory and Johnson.
Math. Program., 2012
2011
A Geometric Perspective on Lifting.
Oper. Res., 2011
2010
Minimal Inequalities for an Infinite Relaxation of Integer Programs.
SIAM J. Discret. Math., 2010
Equivalence between intersection cuts and the corner polyhedron.
Oper. Res. Lett., 2010
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs.
Math. Oper. Res., 2010
Maximal Lattice-Free Convex Sets in Linear Subspaces.
Math. Oper. Res., 2010
On Lifting Integer Variables in Minimal Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
Polyhedral Approaches to Mixed Integer Linear Programming.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010
2009
The mixing set with divisible capacities: A simple approach.
Oper. Res. Lett., 2009
Network Formulations of Mixed-Integer Programs.
Math. Oper. Res., 2009
2008
Compact formulations as a union of polyhedra.
Math. Program., 2008
The Mixing Set with Divisible Capacities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
2007
The Mixing Set with Flows.
SIAM J. Discret. Math., 2007
SIAM J. Discret. Math., 2007
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints.
Math. Oper. Res., 2007
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007
Mixed-Integer Vertex Covers on Bipartite Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007
2006
Odd Hole Recognition in Graphs of Bounded Clique Size.
SIAM J. Discret. Math., 2006
Recognizing Balanceable Matrices.
Math. Program., 2006
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements.
Comb., 2006
2005
Disjoint paths in arborescences.
Discret. Math., 2005
2004
Square-free perfect graphs.
J. Comb. Theory, Ser. B, 2004
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins.
Discret. Appl. Math., 2004
Edge-Connectivity Augmentation and Network Matrices.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Bicolorings and Equitable Bicolorings of Matrices.
Proceedings of the Sharpest Cut, 2004
2003
Reconstructing edge-disjoint paths.
Oper. Res. Lett., 2003
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, 2003
2002
Even-hole-free graphs part I: Decomposition theorem.
J. Graph Theory, 2002
Even-hole-free graphs part II: Recognition algorithm.
J. Graph Theory, 2002
Perfect Graphs, Partitionable Graphs and Cutsets.
Comb., 2002
2001
Balanced 0-1 Matrices II. Recognition Algorithm.
J. Comb. Theory, Ser. B, 2001
Balanced 0-1 Matrices I. Decomposition.
J. Comb. Theory, Ser. B, 2001
Perfect, ideal and balanced matrices.
Eur. J. Oper. Res., 2001
Shortest paths in conservative graphs.
Discret. Math., 2001
2000
Triangle-free graphs that are signable without even holes.
J. Graph Theory, 2000
A polyhedral approach to an integer multicommodity flow problem.
Discret. Appl. Math., 2000
1999
Even and odd holes in cap-free graphs.
J. Graph Theory, 1999
Decomposition of Balanced Matrices.
J. Comb. Theory, Ser. B, 1999
Balanced cycles and holes in bipartite graphs.
Discret. Math., 1999
1998
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
1997
A branch-and-cut algorithm for the equicut problem.
Math. Program., 1997
Universally Signable Graphs.
Comb., 1997
Finding an Even Hole in a Graph.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
Perfect Matchings in Balanced Hypergraphs.
Comb., 1996
1995
Balanced 0, +-1-matrixces, bicoloring and total dual integrality.
Math. Program., 1995
A Class of Logic Problems Solvable by Linear Programming.
J. ACM, 1995
Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs.
Discret. Appl. Math., 1995
A Mickey-Mouse Decomposition Theorem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1994
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes.
Math. Oper. Res., 1994
Recognizing Balanced 0, +/- Matrices.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994
1993
Testing balancedness and perfection of linear matrices.
Math. Program., 1993
1992
Structural properties and decomposition of linear balanced matrices.
Math. Program., 1992
Properties of balanced and perfect matrices.
Math. Program., 1992
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations.
Discret. Math., 1992
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets.
Discret. Math., 1992
1991
The equipartition polytope. II: Valid inequalities and facets.
Math. Program., 1991
The equipartition polytope. I: Formulations, dimension and basic facets.
Math. Program., 1991
1990
A Decomposition Theorem for Balanced Matrices.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990
1989
Odd cycles and matrices with integrality properties.
Math. Program., 1989
On the geometric structure of independence systems.
Math. Program., 1989
1988
On the Facial Structure of Independence System Polyhedra.
Math. Oper. Res., 1988
A characterization of matroidal systems of inequalities.
Discret. Math., 1988
1987
An algorithmic framework for the matching problem in some hypergraphs.
Networks, 1987
Structural properties and recognition of restricted and strongly unimodular matrices.
Math. Program., 1987
Some New Matroids on Graphs: Cut Sets and the Max Cut Problem.
Math. Oper. Res., 1987
<i>K</i><sub><i>i</i></sub>-covers. II. <i>K</i><sub><i>i</i></sub>-perfect graphs.
J. Graph Theory, 1987
A construction for binary matroids.
Discret. Math., 1987
1986
K<sub>i</sub>-covers I: Complexity and polytopes.
Discret. Math., 1986
1984
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem.
Discret. Appl. Math., 1984
