Federico Battista, Ph.D.
Curriculum Vitae
Personal information
Affiliation | Dept. of Industrial and Systems Engineering, Lehigh University |
Address | Harold S. Mohler Laboratory 200, West Packer Avenue, Bethlehem, PA 18015-1582, USA |
Date of birth | 1995.09.03 |
Nationality | Italian |
feb223@lehigh.edu | |
Url | https://febattista.github.io |
Professional experience
-
2023.02 - Present Bethlehem, PA, USA
Postdoctoral Researcher
Dept. of Industrial and Systems Engineering, Lehigh University
Advisor: Prof. Ted Ralphs
Research: Development of methods for solving general Mixed-Integer Bilevel Linear Programs.
-
2022.02 - 2022.08 Klagenfurt, Austria
Visiting Ph.D. Student
Institut für Mathematik, Alpen-Adria-Universität
Advisor: Prof. Angelika Wiegele
Research: Development of Alternating Directions Method of Multipliers for large-scale Semidefinite Programs.
Education
-
2019.11 - 2023.01 Rome, Italy
Ph.D in Operations Research
Università degli Studi di Roma "La Sapienza"
Advisors: Prof. Marianna De Santis, Prof. Fabrizio Rossi, Prof. Stefano Smriglio
Thesis: On Semidefinite Lift-and-Project of Combinatorial Optimization Problems
-
2017.10 - 2019.07 L'Aquila, Italy
Master's degree in Computer Science
Università degli Studi dell'Aquila
Advisors: Prof. Fabrizio Rossi, Prof. Stefano Smriglio
Thesis: Application of the Lovász-Schrijver M+( ) operator to compact stable set integer programs
Final mark: 110/110 magna cum laude
-
2014.09 - 2017.10 L'Aquila, Italy
Bachelor's degree in Computer Science
Università degli Studi dell'Aquila
Advisor: Prof. Giovanni De Gasperis
Thesis: Natural Language Processing and Machine Learning for Conversational Agents
Final mark: 110/110 magna cum laude
Software
-
Maintainer SDP_lift_and_project Python / Matlab
An open-source software package for formulating and solving via a Cutting Plane method, Lovász and Schrijver's Lift-and-Project semidefinite relaxations. Although this software is designed to be as general as possible, allowing the application of the Lovász and Schrijver's operator to any Linear Programming (LP) formulation, a strong emphasis has been placed on LP relaxations of the Maximum Stable Set Problem (MSSP).
-
Maintainer ADAL-ineq Python / Matlab
An open-source solver for large-scale Semidefinite Programs with inequality constraints, implementing an Alternating Direction Method of Multipliers. ADAL-ineq has several advanced features, such that the ability to provide safe estimate of the optimal solution value via the computation of multiple valid dual bounds throughout the iterations of the algorithm.
-
Contributor MibS: Mixed Integer Bilevel Solver C++
A software package for solving mixed integer bilevel programs using branch-and-cut algorithm. Such programs arise in the analysis of hierarchical decision systems with multiple, independent decision-makers whose interests are not necessarily aligned.
-
Contributor SYMPHONY C
An open-source generic MILP solver, callable library, and extensible framework for implementing customized solvers for mixed-integer linear programs (MILPs). SYMPHONY has a number of advanced capabilities, including the ability to solve multi-objective MILPs, the ability to warm start its solution procedure, and the ability to perform basic sensitivity analyses. SYMPHONY has has been deployed in a variety of application areas, including computational biology, wireless telecommunications, supply chain management, transportation services, and air transportation.
Languages
Italian | |
Native speaker |
English | |
Fluent |
French | |
Basic |
Refereed Publications
Technical Reports and Publications In Review
2024
-
F. Battista, T. Ralphs, A Branch-and-Cut Algorithm for Mixed-Integer Bilevel Linear Optimization Based on Improving Directions, Working paper, COR@L Laboratory, Lehigh University [ BIB ]
-
F. Battista, F. Rossi, S. Smriglio, Application of the Lovász-Schrijver Operator to Compact Stable Set Integer Programs, arXiv preprint arXiv:2407.19290 [ DOI ] [ BIB ]
Conference Presentations and Talks
2024
-
F. Battista, T. Ralphs, A Branch-and-Cut Algorithm for Mixed-Integer Bilevel Linear Optimization Based on Improving Directions, International Symposium on Mathematical Programming, Montreal, Canada [ PDF ]
2023
-
F. Battista, T. Ralphs, Exploiting Dual Functions in Mixed Integer Bilevel Linear Programs, INFORMS Annual Meeting, Phoenix, AZ [ PDF ]
2022
-
F. Battista, M. De Santis, F. Rossi, S. Smriglio, On Semidefinite Lift-and-Project Relaxations for Combinatorial Optimization Problems, University of Pavia, Pavia, Italy [ PDF ]
-
F. Battista, F. Rossi, S. Smriglio, Application of the Lovász-Schrijver Operator to Representative Formilation for Graph Coloring Problem, International Symposium on Combinatorial Optimization, Paris, France [ PDF ]
2021
-
F. Battista, M. De Santis, Dealing with Inequalities in Large Scale Semidefinite Programs, International Conference on Optimization and Decision Science, Rome, Italy [ PDF ]