Michele Conforti

	2012
58		Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: A counterexample to a conjecture of Gomory and Johnson. Math. Program. 133(1-2): 25-38 (2012)
	2011
57		Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: A Geometric Perspective on Lifting. Operations Research 59(3): 569-577 (2011)
	2010
56		Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: On Lifting Integer Variables in Minimal Inequalities. IPCO 2010: 85-95
55		Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: Extended formulations in combinatorial optimization. 4OR 8(1): 1-48 (2010)
54		Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli: Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. Math. Oper. Res. 35(3): 603-623 (2010)
53		Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: Maximal Lattice-Free Convex Sets in Linear Subspaces. Math. Oper. Res. 35(3): 704-720 (2010)
52		Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: Equivalence between intersection cuts and the corner polyhedron. Oper. Res. Lett. 38(3): 153-155 (2010)
51		Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM J. Discrete Math. 24(1): 158-168 (2010)
	2009
50		Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey: Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34(1): 194-209 (2009)
49		Michele Conforti, Giacomo Zambelli: The mixing set with divisible capacities: A simple approach. Oper. Res. Lett. 37(6): 379-383 (2009)
	2008
48		Michele Conforti, Marco Di Summa, Laurence A. Wolsey: The Mixing Set with Divisible Capacities. IPCO 2008: 435-449
47		Michele Conforti, Laurence A. Wolsey: Compact formulations as a union of polyhedra. Math. Program. 114(2): 277-289 (2008)
	2007
46		Michele Conforti, Bert Gerards, Giacomo Zambelli: Mixed-Integer Vertex Covers on Bipartite Graphs. IPCO 2007: 324-336
45		Michele Conforti, Marco Di Summa, Laurence A. Wolsey: The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO 2007: 352-366
44		Michele Conforti, Marco Di Summa, Giacomo Zambelli: Minimally Infeasible Set-Partitioning Problems with Balanced Constraints. Math. Oper. Res. 32(3): 497-507 (2007)
43		Michele Conforti, Bert Gerards: Packing Odd Circuits. SIAM J. Discrete Math. 21(2): 273-302 (2007)
42		Michele Conforti, Marco Di Summa, Laurence A. Wolsey: The Mixing Set with Flows. SIAM J. Discrete Math. 21(2): 396-407 (2007)
	2006
41		Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. Combinatorica 26(5): 533-558 (2006)
40		Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic: Balanced matrices. Discrete Mathematics 306(19-20): 2411-2437 (2006)
39		Michele Conforti, Giacomo Zambelli: Recognizing Balanceable Matrices. Math. Program. 105(2-3): 161-179 (2006)
38		Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli: Odd Hole Recognition in Graphs of Bounded Clique Size. SIAM J. Discrete Math. 20(1): 42-48 (2006)
	2005
37		Livio Colussi, Michele Conforti, Giacomo Zambelli: Disjoint paths in arborescences. Discrete Mathematics 292(1-3): 187-191 (2005)
	2004
36		Michele Conforti, Anna Galluccio, Guido Proietti: Edge-Connectivity Augmentation and Network Matrices. WG 2004: 355-364
35		Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic: Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. Discrete Applied Mathematics 141(1-3): 41-91 (2004)
34		Michele Conforti, Giovanni Rinaldi, Laurence A. Wolsey: On the cut polyhedron. Discrete Mathematics 277(1-3): 279-285 (2004)
33		Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic: Square-free perfect graphs. J. Comb. Theory, Ser. B 90(2): 257-307 (2004)
	2003
32		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): 300-330 (2003)
31		Michele Conforti, Refael Hassin, R. Ravi: Reconstructing edge-disjoint paths. Oper. Res. Lett. 31(3): 273-276 (2003)
	2002
30		Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic: Perfect Graphs, Partitionable Graphs and Cutsets. Combinatorica 22(1): 19-33 (2002)
	2001
29		Michele Conforti, Romeo Rizzi: Shortest paths in conservative graphs. Discrete Mathematics 226(1-3): 143-153 (2001)
28		Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Perfect, ideal and balanced matrices. European Journal of Operational Research 133(3): 455-461 (2001)
27		Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Balanced 0-1 Matrices I. Decomposition. J. Comb. Theory, Ser. B 81(2): 243-274 (2001)
26		Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Balanced 0-1 Matrices II. Recognition Algorithm. J. Comb. Theory, Ser. B 81(2): 275-306 (2001)
	2000
25		Michele Conforti, Bert Gerards, Ajai Kapoor: A Theorem of Truemper. Combinatorica 20(1): 15-26 (2000)
24		Lorenzo Brunetta, Michele Conforti, Matteo Fischetti: A polyhedral approach to an integer multicommodity flow problem. Discrete Applied Mathematics 101(1-3): 13-36 (2000)
	1999
23		Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic: Balanced cycles and holes in bipartite graphs. Discrete Mathematics 199(1-3): 27-33 (1999)
22		Michele Conforti, Gérard Cornuéjols, M. R. Rao: Decomposition of Balanced Matrices. J. Comb. Theory, Ser. B 77(2): 292-406 (1999)
	1998
21		Michele Conforti, Ajai Kapoor: A Theorem of Truemper. IPCO 1998: 53-68
	1997
20		Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Finding an Even Hole in a Graph. FOCS 1997: 480-485
19		Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Universally Signable Graphs. Combinatorica 17(1): 67-77 (1997)
18		Lorenzo Brunetta, Michele Conforti, Giovanni Rinaldi: A branch-and-cut algorithm for the equicut problem. Math. Program. 77: 243-263 (1997)
	1996
17		Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Perfect Matchings in Balanced Hypergraphs. Combinatorica 16(3): 325-329 (1996)
	1995
16		Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: A Mickey-Mouse Decomposition Theorem. IPCO 1995: 321-328
15		Michele Conforti, Gérard Cornuéjols, M. R. Rao: Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. Discrete Applied Mathematics 62(1-3): 103-117 (1995)
14		Michele Conforti, Gérard Cornuéjols: A Class of Logic Problems Solvable by Linear Programming. J. ACM 42(5): 1107-1113 (1995)
13		Michele Conforti, Gérard Cornuéjols: Balanced 0, +-1-matrixces, bicoloring and total dual integrality. Math. Program. 71: 249-258 (1995)
	1994
12		Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Recognizing Balanced 0, +/- Matrices. SODA 1994: 103-111
	1993
11		Michele Conforti, M. R. Rao: Testing balancedness and perfection of linear matrices. Math. Program. 61: 1-18 (1993)
	1992
10		Michele Conforti, Gérard Cornuéjols: A Class of Logic Problems Solvable by Linear Programming FOCS 1992: 670-675
9		Michele Conforti, M. R. Rao: Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets. Discrete Mathematics 104(1): 23-47 (1992)
8		Michele Conforti, M. R. Rao: Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations. Discrete Mathematics 110(1-3): 81-118 (1992)
7		Michele Conforti, M. R. Rao: Structural properties and decomposition of linear balanced matrices. Math. Program. 55: 129-168 (1992)
6		Michele Conforti, M. R. Rao: Properties of balanced and perfect matrices. Math. Program. 55: 35-47 (1992)
	1991
5		Michele Conforti, M. R. Rao, Antonio Sassano: The equipartition polytope. I: Formulations, dimension and basic facets. Math. Program. 49: 49-70 (1991)
4		Michele Conforti, M. R. Rao, Antonio Sassano: The equipartition polytope. II: Valid inequalities and facets. Math. Program. 49: 71-90 (1991)
	1990
3		Michele Conforti, Gérard Cornuéjols: A Decomposition Theorem for Balanced Matrices. IPCO 1990: 147-169
	1987
2		Francisco Barahona, Michele Conforti: A construction for binary matroids. Discrete Mathematics 66(3): 213-218 (1987)
	1986
1		Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub: Ki-covers I: Complexity and polytopes. Discrete Mathematics 58(2): 121-142 (1986)

Coauthor Index

1	Francisco Barahona	[2]
2	Amitabh Basu	[51] [53] [56] [58]
3	Lorenzo Brunetta	[18] [24]
4	Manoel B. Campêlo	[56]
5	Livio Colussi	[37]
6	Derek G. Corneil	[1]
7	Gérard Cornuéjols	[3] [10] [12] [13] [14] [15] [16] [17] [19] [20] [22] [23] [26] [27] [28] [30] [32] [33] [35] [38] [40] [41] [51] [52] [53] [55] [56] [57] [58]
8	Friedrich Eisenbrand	[50]
9	Matteo Fischetti	[24]
10	Anna Galluccio	[36]
11	Grigor Gasparyan	[30]
12	Bert Gerards (A. M. H. Gerards)	[25] [43] [46]
13	Refael Hassin	[31]
14	Ajai Kapoor	[12] [16] [17] [19] [20] [21] [25] [26] [27] [28]
15	Xinming Liu	[38]
16	Ali Ridha Mahjoub	[1]
17	Guido Proietti	[36]
18	M. R. Rao	[4] [5] [6] [7] [8] [9] [11] [15] [22]
19	R. Ravi	[31]
20	Giovanni Rinaldi	[18] [34]
21	Romeo Rizzi	[29]
22	Antonio Sassano	[4] [5]
23	Marco Di Summa	[42] [44] [45] [48] [50]
24	Kristina Vuskovic	[12] [16] [17] [19] [20] [23] [26] [27] [28] [30] [33] [35] [38] [40]
25	Laurence A. Wolsey	[34] [42] [45] [47] [48] [50] [54]
26	Giacomo Zambelli	[37] [38] [39] [41] [44] [46] [49] [51] [52] [53] [54] [55] [56] [57] [58]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page