Michele Conforti

from Wikipedia, the free encyclopedia

Michelangelo "Michele" Conforti is an Italian mathematician who specializes in operations research , integer programming , graph theory, and combinatorial optimization .

Education and career

Michele Conforti, Oberwolfach 2011

Conforti received his PhD in 1983 from Gérard Cornuéjols at Carnegie Mellon University (Essay in Combinatorial Optimization). He is a professor at the University of Padua .

research

In 2000 he and Cornuéjols and MR Rao received the Fulkerson Prize for their work Decomposition of balanced matrices on the characterization of balanced matrices , which also provides an algorithm to recognize such matrices in polynomial time. He also contributed to the strong theorem on perfect graphs .

Awards and honors

Fonts

  • with Cornuejols: Balanced Matrices , in: K. Aardal, GL Nemhauser, R. Weismantel (editor) Discrete Optimization , Handbooks of Operations Research and Management Science, Volume 12, Elsevier 2005
  • with G. Cornuéjols, K. Vušković: Square-Free Perfect Graphs , J. Combin. Theory Ser. B, Volume 90, 2004, pp. 257-307.

Web links

Individual evidence

  1. Michele Conforti in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. Journal of Combinatorial Theory, Series B, Vol. 77, 1999, pp. 292-406
  3. 0.1 matrices without square sub-matrices of odd order with row or column sum 2
  4. Chvatal Strong Perfect Graph Theorem
  5. ^ Frederick W. Lanchester Prize. (No longer available online.) Informs.org ( Institute for Operations Research and the Management Sciences ), archived from the original on October 2, 2015 ; accessed on February 16, 2016 . Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2Template: Webachiv / IABot / www.informs.org