Homepage of Giacomo Zambelli

 Contact Info 

  Department of Management  Office: NAB.3.36 
  London School of Economics and Political Sciences   Phone: +44 (0)20 7106 1265 
  Houghton Street    Fax: +44 (0)20 7404 4213 
  London WC2A 2AE    email 

 Bio  

I am a lecturer in the Management Science group since September 2010. Before moving to LSE I was assistant professor at the University of Padua (Italy). I completed my PhD in Algorithms, Combinatorics and Optimization at the Tepper School of Business, Carnegie Mellon University.
A copy of my CV can be downloaded from my official page.

 Research Interests 

Polyhedral Combinatorics, Integer Programming, Combinatorial Optimization, 0/1 Matrices, Graph Theory.


 Teaching 

Lent Term 2010/11: OR406 - Mathematical Programming: theory and algorithms.

 Publications 

Preprints
A. Basu, M. Campelo, M. Conforti, G. Cornuejols, G. Zambelli, Unique Lifting of Integer Variables in Minimal Inequalities, 2011, submitted. 
A. Del Pia, A. Musitelli, G. Zambelli, A class of matrices with the Edmonds-Johnson property, 2011, submitted. 
Papers published in international refereed journals
M. Conforti, G. Cornuéjols, G. Zambelli, A geometric perspective on lifting, Operations Research 59 (2011), 569-577.
[doi:10.1287/opre.1110.0916
A. Basu, G. Cornuéjols, G. Zambelli, Convex Sets and Minimal Sublinear Functions, Journal of Convex Analysis 18 (2011), 427-432.
[http://www.heldermann.de/JCA/JCA18/JCA182/jca18026.htm
M. Conforti, G. Cornuéjols, G. Zambelli, Corner Polyhedron and Intersection Cuts, Surveys in Operations Research and Management Science 16 (2011), 105-120.
[doi:10.1016/j.sorms.2011.03.001]
M. Conforti, L.A. Wolsey, G. Zambelli, Projecting an extended formulation for mixed-integer covers on bipartite graphs , Mathematics of Operations Research 35 (2010), 603-623.
[doi:10.1287/moor.1100.0454
A. Basu, M. Conforti, G. Cornuéjols, G. Zambelli, Maximal lattice-free convex sets in linear subspaces, Mathematics of Operations Research 35 (2010), 704 - 720.
[doi:10.1287/moor.1100.0461
A. Basu, M. Conforti, G. Cornuéjols, G. Zambelli, A Counterexample to a Conjecture of Gomory and Johnson, Mathematical Programming (2010).
[The original publication is available at www.springerlink.com, doi:10.1007/s10107-010-0407-1
M. Conforti, G. Cornuéjols, G. Zambelli, Extended Formulations in Combinatorial Optimization , 4OR 8 (2010), 1-48.
[doi:10.1007/s10288-010-0122-z
A. Basu, M. Conforti, G. Cornuéjols, G. Zambelli, Minimal inequalities for an infinite relaxation of integer programs, SIAM Journal on Discrete Optimization 24 (2010), 158-168.
[doi:10.1137/090756375
M. Conforti, G. Cornuéjols, G. Zambelli, Equivalence between intersection cuts and the corner polyhedron, Operations Research Letters 38 (2010), 153-155.
[doi:10.1016/j.orl.2010.02.006
M. Conforti, G. Zambelli, The mixing set with divisible capacities: a simple approach , Operations Research Letters 37 (2009), 379-383.
[doi:10.1016/j.orl.2009.07.001
A. Del Pia, G. Zambelli, Half-integral vertex covers on bipartite bidirected graphs: total dual integrality and cut-rank, SIAM Journal on Discrete Mathematics 23 (2009), 1281-1296.
[doi:10.1137/070703399
G. Zambelli, On degenerate multi-row Gomory cuts , Operations Research Letters 37 (2009), 21-22.
[doi:10.1016/j.orl.2008.09.005] 
G. Zambelli, Colorings of k-balanced matrices and integer decomposition property of certain polyhedra, Operations Research Letters 35 (2007), 353-356.
[doi:10.1016/j.orl.2006.06.006] 
M. Conforti, M. Di Summa, G. Zambelli, Minimally Infeasible Set Partitioning Problems with Balanced Constraints, Mathematics of Operations Research 32 (2007), 497-507.
[doi:10.1287/moor.1070.0250]  
M. Conforti, G. Cornujols, G. Zambelli, Decomposing Berge Graphs Containing no Proper Wheels, Long Prisms or Their Complements, Combinatorica 26 (2006), 533-558.
[The original publication is available at www.springerlink.com, doi:10.1007/s00493-006-0031-0]  
M. Conforti, G. Cornuéjols, X. Liu, K. Vušković, G. Zambelli, Odd Hole Recognition in Graphs of Bounded Clique Size, SIAM Journal on Discrete Mathematics 20 (2006) 42-48.
[doi:10.1137/S089548010444540X]  
M. Conforti and G. Zambelli, Recognizing Balanceable Matrices, Mathematical Programming B 105 (2006), 161-179.
[The original publication is available at www.springerlink.com, doi:10.1007/s10107-005-0647-7]  
L. Colussi, M. Conforti, G. Zambelli, Disjoint Paths in Arborescences, Discrete Mathematics 292 (2005) 187-191.
[doi:10.1016/j.disc.2004.12.005]  
G. Zambelli, A Polynomial Recognition Algorithm for Balanced Matrices, Journal of Combinatorial Theory Series B 95 (2005) 49-67.
[doi:10.1016/j.jctb.2005.02.006]  
Papers published in refereed conference proceedings
A. Basu, M. Campelo, M. Conforti, G. Cornuéjols, G. Zambelli, On Lifting Integer Variables in Minimal Inequalities, in Integer Programming and Combinatorial Optimization (F. Eisenbrand and B. Shepherd eds.), proceedings of IPCO 2010, LNCS Vol. 6080, Springer, 2010, pp. 85-95.
[The original publication is available at www.springerlink.com, doi:10.1007/978-3-642-13036-6_7]  
M. Conforti, B. Gerards, G. Zambelli, Mixed-integer vertex covers on bipartite graphs , in Integer Programming and Combinatorial Optimization (M. Fischetti and D.P. Williamson eds.), proceedings of IPCO 2007, LNCS Vol. 4513, Springer, 2007, pp. 324-336.
[The original publication is available at www.springerlink.com, doi:10.1007/978-3-540-72792-7_25]  
Book chapters
M. Conforti, G. Cornuéjols, G. Zambelli, Polyhedral Approaches to Mixed Integer Linear Programming, 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art (M. Juenger, T. Liebling, D. Naddef, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey, eds.), Springer, 2010.
M. Conforti, G. Cornuéjols, G. Zambelli, Bicolorings and Equitable Bicolorings of Matrices, The Sharpest Cut, MPS/SIAM Series on Optimization (M. Groetschel, ed.) (2004) 33-36. 
Theses
G. Zambelli, On Perfect Graphs and Balanced Matrices, Ph.D. Thesis, Tepper School of Business, Carnegie Mellon University (2004). 

 Disclaimer: the papers available on this webpage might slightly differ from the final printed version.

  Last updated January 2012