Conforti Michele

Michele Conforti

Information about the author Michele Conforti will soon be added to the site.
Found 20 papers in total
Extended formulations in combinatorial optimization
Extended formulations in combinatorial optimization
2013
This survey is concerned with the size of perfect formulations for combinatorial...
A Geometric Perspective on Lifting
A Geometric Perspective on Lifting
2011
Recently it has been shown that minimal inequalities for a continuous relaxation of...
Projecting an extended formulation for mixed-integer covers on bipartite graphs
Projecting an extended formulation for mixed-integer covers on bipartite graphs
2010
We consider the mixed-integer version of bipartite vertex cover. This is equivalent to...
Maximal lattice-free convex sets in linear subspaces
Maximal lattice-free convex sets in linear subspaces
2010
We consider a model that arises in integer programming and show that all irredundant...
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
2007
We study properties of systems of linear constraints that are minimally infeasible...
Perfect, ideal and balanced matrices
Perfect, ideal and balanced matrices
2001
In this paper, we survey results and open problems on perfect, ideal and balanced...
A polyhedral approach to an integer multicommodity flow problem
A polyhedral approach to an integer multicommodity flow problem
2000
In this paper we propose a branch-and-cut algorithm for the exact solution of an...
A branch-and-cut algorithm for the equicut problem
A branch-and-cut algorithm for the equicut problem
1997
We describe an algorithm for solving the equicut problem on complete graphs. The core...
Perfect, ideal and balanced matrices
Perfect, ideal and balanced matrices
1996
In this paper, we survey results and open problems about perfect, ideal and balanced...
Balanced 0, ¸ℝà1-matrices, bicoloring and total dual integrality
Balanced 0, ¸ℝà1-matrices, bicoloring and total dual integrality
1995
A 0,¸±1-matrix A is balanced if, in every submatrix with two nonzero...
Testing balancedness and perfection of linear matrices
Testing balancedness and perfection of linear matrices
1993
A (0,1) matrix is linear if it does not contain a 2×2 submatrix of all ones. In...
From totally unimodular to balanced
From totally unimodular to balanced
1994
In this paper the authors introduce a family of integer polytopes and characterize...
Properties of balanced and perfect matrices
Properties of balanced and perfect matrices
1992
In this paper the authors define wheel matrices and characterize some properties of...
Structural properties and decomposition of linear balanced matrices
Structural properties and decomposition of linear balanced matrices
1992
Claude Berge defines a (0,1) matrix A to be linear if A does not contain a 2×2...
The equipartition polytope. I: Formulations, dimension and basic facets
The equipartition polytope. I: Formulations, dimension and basic facets
1990
The following basic clustering problem arises in different domains, ranging from...
The equipartition polytope. II: Valid inequalities and facets
The equipartition polytope. II: Valid inequalities and facets
1990
The equipartition problem is defined as follows: given a graph G= ( V, e ) and edge...
Some easily solvable nonlinear integer programs
Some easily solvable nonlinear integer programs
1989
The authors introduce functions F defined in R n and feasible sets S of integral n-...
On the geometric structure of independence systems
On the geometric structure of independence systems
1989
A bouquet of matroids is a combinatorial structure that generalizes the properties of...
Odd cycles and matrices with integrality properties
Odd cycles and matrices with integrality properties
1989
A cycle of a bipartite graph G(V’+,V’-;E) is odd if its length is 2...
On the facial structure of independence system polyhedra
On the facial structure of independence system polyhedra
1988
A polyhedron P whose extreme points are the incidence vectors of the sets of an...
Papers per page: