Preprints
| A. Basu, M. Conforti, G. Cornuéjols, G. Zambelli, Minimal inequalities for an infinite relaxation of integer programs, SIAM Journal on Discrete Optimization (2010), to appear. |
| A. Basu, M. Campelo, M. Conforti, G. Cornuéjols, G. Zambelli, On Lifting Integer Variables in Minimal Inequalities, 2009, accepted in IPCO 2010. |
| M. Conforti, G. Cornuéjols, G. Zambelli, A geometric perspective on lifting, 2009, submitted. |
| A. Basu, M. Conforti, G. Cornuéjols, G. Zambelli, Maximal lattice-free convex sets in linear subspaces, 2009, submitted. |
| M. Conforti, G. Cornuéjols, G. Zambelli, Every nontrivial facet-defining inequality for the corner polyhedron is an intersection cut, 2009, submitted. |
| A. Basu, G. Cornuéjols, G. Zambelli, Convex Sets and Minimal Sublinear Functions, 2009, submitted. |
| M. Conforti, G. Cornuéjols, G. Zambelli, Extended Formulations in Combinatorial Optimization , 2009, submitted (survey). |
| M. Conforti, L.A. Wolsey, G. Zambelli, Projecting an extended formulation for
mixed-integer covers on bipartite graphs , 2008, submitted. |
| A. Basu, M. Conforti, G. Cornuéjols, G. Zambelli, A Counterexample to a Conjecture of Gomory and Johnson, 2008, submitted. |
|
Papers published in international refereed journals
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
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
|
