Zambelli, Giacomo

Number of items: 35.
None
  • Bonami, Pierre, Conforti, Michele, Cornuéjols, Gérard, Molinaro, Marco, Zambelli, Giacomo (2013). Cutting planes from two-term disjunctions. Operations Research Letters, 41(5), 442-444. https://doi.org/10.1016/j.orl.2013.05.005
  • Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2013). Extended formulations in combinatorial optimization. Annals of Operations Research, 204(1), 97-143. https://doi.org/10.1007/s10479-012-1269-0
  • Basu, Amitabh, Campelo, Manoel B., Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2012). Unique lifting of integer variables in minimal inequalities. Mathematical Programming, Online, https://doi.org/10.1007/s10107-012-0560-9
  • Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2011). Corner polyhedron and intersection cuts. Surveys in Operations Research and Management Science, 16(2), 105-120. https://doi.org/10.1016/j.sorms.2011.03.001
  • Basu, Amitabh, Cornuéjols, Gérard, Zambelli, Giacomo (2011). Convex Sets and Minimal Sublinear Functions. Journal of Convex Analysis, 18(2), 427-432.
  • Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2011). A geometric perspective on lifting. Operations Research, 59(3), 567-577. https://doi.org/10.1287/opre.1110.0916
  • Basu, Amitabh, Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2010). A counterexample to a conjecture of Gomory and Johnson. Mathematical Programming, https://doi.org/10.1007/s10107-010-0407-1
  • Basu, Amitabh, Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2010). Maximal lattice-free convex sets in linear subspaces. Mathematics of Operations Research, 35(3), 704-720. https://doi.org/10.1287/moor.1100.0461
  • Conforti, Michele, Wolsey, Laurence A., Zambelli, Giacomo (2010). Projecting an extended formulation for mixed-integer covers on bipartite graphs. Mathematics of Operations Research, 35(3), 603-623. https://doi.org/10.1287/moor.1100.0454
  • Basu, Amitabh, Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2010). Minimal inequalities for an infinite relaxation of integer programs. SIAM Journal on Discrete Mathematics, 24(1), 158-168. https://doi.org/10.1137/090756375
  • Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2010). Equivalence between intersection cuts and the corner polyhedron. Operations Research Letters, 38(3), 153-155. https://doi.org/10.1016/j.orl.2010.02.006
  • Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2010). Extended formulations in combinatorial optimization. 4or: a Quarterly Journal of Operations Research, 8(1), 1-48. https://doi.org/10.1007/s10288-010-0122-z
  • Bazu, Amithabh, Campelo, Manoel B., Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2010). On lifting integer variables in minimal inequalities. In Eisenbrand, F. & Shepherd, B. (Eds.), Integer Programming and Combinatorial Optimization (pp. 85-95). Springer Berlin / Heidelberg.
  • Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2010). Polyhedral approaches to mixed integer linear programming. In Jünger, M., Liebling, T. M., Naddef, D., Nemhauser, G. L., Pulleyblank, W. R., Reinelt, G., Rinaldi, G. & Wolsey, L. A. (Eds.), 50 Years of Integer Programming 1958-2008: From the Early Years to the State-Of-The-Art (pp. 334-384). Springer Berlin / Heidelberg.
  • Conforti, Michele, Zambelli, Giacomo (2009). The mixing set with divisible capacities: a simple approach. Operations Research Letters, 37(6), 379-383. https://doi.org/10.1016/j.orl.2009.07.001
  • Del Pia, Alberto, Zambelli, Giacomo (2009). Half-integral vertex covers on bipartite bidirected graphs: total dual integrality and cut-rank. SIAM Journal on Discrete Mathematics, 23(3), 1281-1296. https://doi.org/10.1137/070703399
  • Zambelli, Giacomo (2009). On degenerate multi-row Gomory cuts. Operations Research Letters, 37(1), 21-22. https://doi.org/10.1016/j.orl.2008.09.005
  • Zambelli, Giacomo (2007). Colorings of k-balanced matrices and integer decomposition property of related polyhedra. Operations Research Letters, 35(3), 353-356. https://doi.org/10.1016/j.orl.2006.06.006
  • Conforti, Michele, Summa, Marco Di, Zambelli, Giacomo (2007). Minimally infeasible set-partitioning problems with balanced constraints. Mathematics of Operations Research, 32(3), 497-507. https://doi.org/10.1287/moor.1070.0250
  • Conforti, Michele, Gerards, Bert, Zambelli, Giacomo (2007). Mixed-integer vertex covers on bipartite graphs. In Fischetti, M. & Williamson, print. (Eds.), Integer Programming and Combinatorial Optimization (pp. 324-336). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-540-72792-7_25
  • Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2006). Decomposing berge graphs containing no proper wheels, long prisms or their complements. Combinatorica, 26(5), 533-558. https://doi.org/10.1007/s00493-006-0031-0
  • Conforti, Michele, Cornuéjols, Gérard, Liu, Xinming, Vuskovic, Kristina, Zambelli, Giacomo (2006). Odd hole recognition in graphs of bounded clique size. SIAM Journal on Discrete Mathematics, 20(1), 42-48. https://doi.org/10.1137/S089548010444540X
  • Conforti, Michele, Zambelli, Giacomo (2006). Recognizing balanceable matrices. Mathematical Programming, 105(2-3), 161-179. https://doi.org/10.1007/s10107-005-0647-7
  • Zambelli, Giacomo (2005). A polynomial recognition algorithm for balanced matrices. Journal of Combinatorial Theory, Series B, 95(1), 49-67. https://doi.org/10.1016/j.jctb.2005.02.006
  • Colussi, Livio, Conforti, Michele, Zambelli, Giacomo (2005). Disjoint paths in arborescences. Discrete Mathematics, 292(1-3), 187-191. https://doi.org/10.1016/j.disc.2004.12.005
  • Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo (2004). Bicolorings and equitable bicolorings of matrices. In Grötschel, M. (Ed.), The Sharpest Cut : the Impact of Manfred Padberg and His Work (pp. 33-37). Society for Industrial and Applied Mathematics.
    • Public
  • Abdi, Ahmad, Cornuéjols, Gérard, Zambelli, Giacomo (2024). Arc connectivity and submodular flows in digraphs. Combinatorica, 44(5), 1069 - 1090. https://doi.org/10.1007/s00493-024-00108-0 picture_as_pdf
  • Dadush, Daniel, Végh, László A., Zambelli, Giacomo (2022). On finding exact solutions of linear programs in the oracle model. In Naor, print. & Buchbinder, N. (Eds.), Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 2700 - 2722). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977073.106 picture_as_pdf
  • Dadush, Daniel, Végh, László A., Zambelli, Giacomo (2021). Geometric rescaling algorithms for submodular function minimization. Mathematics of Operations Research, 46(3), 1081 - 1108. https://doi.org/10.1287/moor.2020.1064 picture_as_pdf
  • Dadush, Daniel, Végh, László A., Zambelli, Giacomo (2020). Rescaling algorithms for linear conic feasibility. Mathematics of Operations Research, 45(2), 732 - 754. https://doi.org/10.1287/moor.2019.1011 picture_as_pdf
  • Basu, Amitabh, Conforti, Michele, Di Summa, Marco, Zambelli, Giacomo (2019). Optimal cutting planes from the group relaxations. Mathematics of Operations Research, 44(4), 1208-1220. https://doi.org/10.1287/moor.2018.0964
  • Del Pia, Alberto, Musitelli, Antoine, Zambelli, Giacomo (2018). On matrices with the Edmonds-Johnson property arising from bidirected graphs. Journal of Combinatorial Theory, Series B, 130, 49-91. https://doi.org/10.1016/j.jctb.2017.09.013
  • Dadush, Daniel, Végh, László A., Zambelli, Giacomo (2018). Geometric rescaling algorithms for submodular function minimization. In Czumaj, A. (Ed.), Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 832-848). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975031.54 picture_as_pdf
  • Dadush, Daniel, Végh, László A., Zambelli, Giacomo (2016). Rescaled coordinate descent methods for linear programming. In Louveaux, Q. & Skutella, M. (Eds.), Integer Programming and Combinatorial Optimization (pp. 26-37). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-319-33461-5_3
  • Végh, László A., Zambelli, Giacomo (2014). A polynomial projection-type algorithm for linear programming. Operations Research Letters, 42(1), 91-96. https://doi.org/10.1016/j.orl.2013.12.007