Skip to main content
Alberto Del Pia

Alberto Del Pia

Associate Professor

Alberto Del Pia earned his Ph.D. in Mathematics from the University of Padova in 2009, under the supervision of Giacomo Zambelli. He subsequently held postdoctoral positions with Robert Weismantel, first at the Institute for Mathematical Optimization at Otto von Guericke University, and later at the Institute for Operations Research at ETH Zürich. In 2013, he joined the Mathematical Programming group at IBM Research as a Goldstine Fellow. Since 2014, he has been a faculty member at the University of Wisconsin–Madison, where he received tenure in 2020.

Department

Industrial & Systems Engineering

Contact

3120, Mechanical Engineering Bldg
1513 University Ave
Madison, WI

  • PhD 2009, University of Padova
  • MS 2005, University of Padova
  • BS 2004, University of Padova

  • Mathematical optimization
  • Discrete mathematics
  • Mathematics of data science

  • 2023 INFORMS Optimization Society, Egon Balas Prize
  • 2023 INFORMS Computing Society, INFORMS Computing Society Prize
  • 2017 INFORMS Optimization Society, Young Researchers Prize
  • 2013 IBM Research, Herman Goldstine Memorial Postdoctoral Fellowship
  • 2000 Istituto Nazionale di Alta Matematica (INdAM), Scholarship

  • Capelli, F., Del Pia, A., & Di~Gregorio, Silvia, (2024). A knowledge compilation take on binary polynomial optimization. arXiv:2311.00149.
  • Del Pia, A., Knop, D., Lassota, A., Sornat, K., & Talmon, N. (2024). Aggregation of continuous preferences in one dimension. Proceedings of IJCAI 2024.
  • Del Pia, A. (2024). Convex quadratic sets and the complexity of mixed integer convex quadratic programming. arXiv:2311.00099.
  • Del Pia, A., & Khajavirad, A. (2024). Rank-one Boolean tensor factorization and the multilinear polytope. Mathematics of Operations Research.
  • Del Pia, A., Linderoth, J., & Zhu, H. (2024). Relaxations and Cutting Planes for Linear Programs with Complementarity Constraints. Journal of Global Optimization.
  • Del Pia, A., & Zhou, D. (2024). Solving sparse PCA via basic SDP relaxation. Manuscript.
  • Del Pia, A. (2024). The mixed integer trust region problem. arXiv:2402.08827.
  • Del Pia, A., & Khajavirad, A. (2024). The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization. arXiv:2309.08693.
  • Del Pia, A., Del Pia, A., & Kaibel, V. (2023). Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2023. Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2023. Springer.
  • Del Pia, A., Del Pia, A., & Kaibel, V. (2023). Integer Programming and Combinatorial Optimization, 24th International Conference, IPCO 2023, Madison, WI, USA, June 21--23, 2023.

  • COMP SCI 728 - Integer Optimization (Spring 2025)
  • I SY E 728 - Integer Optimization (Spring 2025)
  • I SY E 990 - Research and Thesis (Spring 2025)
  • MATH 728 - Integer Optimization (Spring 2025)
  • MATH 990 - Reading and Research (Spring 2025)
  • COMP SCI 525 - Linear Optimization (Fall 2024)
  • I SY E 525 - Linear Optimization (Fall 2024)
  • I SY E 990 - Research and Thesis (Fall 2024)
  • MATH 525 - Linear Optimization (Fall 2024)
  • STAT 525 - Linear Optimization (Fall 2024)
  • I SY E 990 - Research and Thesis (Summer 2024)
  • COMP SCI 682 - Senior Honors Thesis (Spring 2024)
  • COMP SCI 728 - Integer Optimization (Spring 2024)
  • I SY E 728 - Integer Optimization (Spring 2024)
  • I SY E 990 - Research and Thesis (Spring 2024)
  • MATH 728 - Integer Optimization (Spring 2024)
  • COMP SCI 525 - Linear Optimization (Fall 2023)
  • COMP SCI 681 - Senior Honors Thesis (Fall 2023)
  • I SY E 525 - Linear Optimization (Fall 2023)
  • I SY E 990 - Research and Thesis (Fall 2023)
  • MATH 525 - Linear Optimization (Fall 2023)
  • STAT 525 - Linear Optimization (Fall 2023)