Servizio momentaneamente sospeso per manutenzione.
Rubrica
Qualifica
Studioso senior
Indirizzo
Non assegnato
Telefono
0498271480
Educazione:
University of Bologna, "Laurea in Ingegneria Elettronica", 100n100 e lode 1977.
Carnegie Mellon University, Master of Science in Operations Research 1981.
Carnegie Mellon University, Ph.D. in Operations Research 1983.
Experienza Professionale:
Visiting Professor, Departement de Informatique et Mathematiques Appliquees,
(IMAG) Universite de Grenoble 1983-1984.
Assistant Professor, Department of Statistics and Operations Research, New York
University 1984-1987.
Associate Professor, Department of Statistics and Operations Research, New York
University 1987-1989.
Full Professor, Mathematics Department, Universita di Padova 1990-present.
Ricerca:
Integer Programming, Combinatorial Optimization, Graph Theory, Design
and Analysis of Combinatorial Algorithms, Polyhedra and Inequalities.
Attivita' professionali (last years):
Chairman, Fulkerson Prize Selection Committee (awarded every 3 years by the Amer-
ican Mathematical Society and the Mathematical Optimization Society)
Member of the Organizing and Scientific Committee (3 members) for the "even
year" (every 2 years) Aussois Symposium in Integer Programming and Combinatorial
Optimization
Member of the Selection Committee of IPCO (Integer Programming and Combina-
torial Optimization Meeting) 1992 2001 2005 2011
Avvisi
Orari di ricevimento
Su appuntamento
Pubblicazioni
A. Basu, M. Conforti, G. Cornuéjols, R. Weismantel, S. Weltge, Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. 45 (2017), no. 6, 671-674, (pdf)
M. Conforti, M. Di Summa, Maximal S-free convex sets and the Helly number. SIAM J. Discrete Math. 30 (2016), no. 4, 2206-2216.
M. Conforti, S. Fiorini, K. Pashkovich, Cut dominants and forbidden minors. SIAM J. Discrete Math. 30 (2016), no. 3, 1571-1589.
M. Conforti, K. Pashkovich, The projected faces property and polyhedral relations. Math. Program. 156 (2016), no. 1-2, Ser. A, 331-342.
M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, Reverse split rank. Math.Program. 154 (2015), no. 1-2, Ser. B, 273-303.
A. Basu, M. Conforti, M. Di Summa, A geometric approach to cut-generating functions. Math. Program. 151 (2015), no. 1, Ser. B, 153-189.
M. Conforti, G. Cornuéjols, A. Daniilidis, C. Lemaréchal, J. Malick, Cut-Generating Functions and S-Free Sets, Math. Oper. Res. 40 (2015), no. 2, 276-301.
M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, R. Grappe, Reverse Chvatal-Gomory rank. SIAM J. Discrete Math. 29, no. 1, 166-181 (2015).
M. Conforti, V. Kaibel, M. Walter, S. Weltge The Subgraph Polytope and Independence Polytopes of Count Matroids, Operations research Letters 43 (5) pp. 457-460 (2015).
M. Conforti, B. Gerards, K. Pashkovich, Stable sets and Graphs with no even holes,Mathematical Programming, Volume 153/1, 13-39 (2015).
M. Conforti, A. Del Pia, Disjunctive programming and relaxations of polyhedra, Mathematical Programming, Series A 144(1-2) 307-314 (2014)
G. Averkov, M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, On the convergence of the affine hull of the Chvátal-Gomory closures, SIAM Journal on Discrete Mathematics 27, pp. 1492-1502 (2013).
P. Bonami, M. Conforti, G. Cornuéjols , M. Molinaro and G. Zambelli (2013) Cutting planes from two-term disjunctions. Operations Research Letters, 41 (5). pp. 442-444. ISSN 0167-63774
M. Conforti, G. Cornuéjols and G. Zambelli (2013) Extended formulations in combinatorial optimization. Annals of Operations Research, 204 (1). pp. 97-143. ISSN 0254-5330
A. Basu , M. B. Campelo, M. Conforti, G. Cornuéjols and G. Zambelli (2012) Unique lifting of integer variables in minimal inequalities. Mathematical Programming,Online . ISSN 0025-5610
M. Conforti, G. Cornuéjols and G. Zambelli (2011) Corner polyhedron and intersection cuts. Surveys in Operations Research and Management Science, 16 (2). pp.105-120. ISSN 1876-7354
M. Conforti, G. Cornuéjols and G. Zambelli (2011) A geometric perspective on lifting. Operations Research, 59 (3). pp. 567-577. ISSN 0030-364X
A. Basu, M. Conforti, G. Cornuéjols and G. Zambelli (2010) A counterexample to a conjecture of Gomory and Johnson. Mathematical Programming . ISSN 0025-5610
A. Basu , M. Conforti, G. Cornuéjols and G. Zambelli (2010) Maximal lattice-free convex sets in linear subspaces. Mathematics of Operations Research, 35 (3). pp.704-720. ISSN 0364-765X
M. Conforti, L. A. Wolsey. and G. Zambelli (2010) Projecting an extended formulation for mixed-integer covers on bipartite graphs. Mathematics of Operations Research, 35 (3). pp. 603-623. ISSN 0364-765X
A. Basu , M. Conforti, G. Cornuéjols and G. Zambelli (2010) Minimal inequalities for an infinite relaxation of integer programs. SIAM Journal on Discrete Mathematics, 24 (1). pp. 158-168. ISSN 0895-4801
Area di ricerca
Integer Programming, Combinatorial Optimization, Graph Theory, Design
and Analysis of Combinatorial Algorithms, Polyhedra and Inequalities.