Indirizzo
Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti" (IASI)
Consiglio Nazionale delle Ricerche (CNR)
via dei Taurini, 19, 00185 Roma
Email
sara <punto> mattia <chiocciola> iasi <punto> cnr <punto> it
Posizione corrente
Prima Ricercatrice (II livello) IASI-CNR
- Membro eletto del Consiglio di Istituto dello IASI
- Coordinatrice del gruppo OPTIMA
- Direttrice dell'Unità di Ricerca INδAM presso lo IASI (INδAM @ IASI)
- Membro del GEV01 (Scienze matematiche e informatiche) dell'Agenzia Nazionale
di Valutazione del sistema Universitario e della Ricerca (ANVUR) per la
VQR2020-2024
- Membro del Consiglio Direttivo dell'Associazione Italiana di Ricerca Operativa (AIRO)
- Esperta dell'ambito PE1 - Mathematics per il CNR
- Membro del comitato editoriale di Open Journal of Mathematical Optimization (OJMO)
Pubblicazioni e brevetti
Articoli in rivista
T. Bacci, E. Lanzarone, S. Mattia, P. Ventura
A Benders decomposition approach for planning home blood donations
Flexible services and Manufacturing in stampa, DOI 10.1007/s10696-024-09531-3
S. Mattia
Reformulations and complexity of the clique interdiction problem by graph mapping
Discrete Applied Mathematics, 354, pp. 48--57 (2024)
S. Mattia
The follower optimality cuts for mixed integer linear bilevel programming problems
Soft Computing, 27, pp. 11529-11550 (2023)
T. Bacci, S. Mattia, P. Ventura
The realization-independent reallocation heuristic for the stochastic container relocation problem
Soft Computing, 27, pp. 4223-4233 (2023)
P. Avella, M.Boccia, S. Mattia, F. Rossi
Weak Flow Cover Inequalities for the Capacitated Facility Location Problem
European Journal of Operational Research, 289, pp. 485-494 (2021)
T. Bacci, S. Mattia, P. Ventura
A Branch and Cut algorithm for the Restricted Block Relocation Problem
European Journal of Operational Research, 287, pp. 452-459 (2020)
S. Mattia
A polyhedral analysis of the capacitated edge activation problem with uncertain demands
Networks, 74, pp. 190-204 (2019)
P. Avella, G. Bernardi, M. Boccia, S. Mattia
An optimization approach for congestion control in network routing with quality of service requirements
Networks, 74, pp. 124-133 (2019)
T. Bacci, S. Mattia, P. Ventura
The Bounded Beam Search algorithm for the Block Relocation Problem
Computers & Operations Research, 103, pp. 252-264 (2019)
S. Mattia
MIP-based heuristic approaches for the capacitated edge activation problem: the effect of non-compactness
Soft Computing, 23(9), pp. 2911--2921 (2019)
G. Carello, E. Lanzarone, S. Mattia
Trade-off between stakeholders' goals in the home care nurse-to-patient assignment problem
Operations Research for Health Care, 16, pp. 29-40 (2018)
S. Mattia
The capacity formulation of the capacitated edge activation problem
Networks, 71(4), pp. 381-402 (2018)
S. Mattia, M. Poss
A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
Computational Optimization and Applications, 69(3), pp. 753-800 (2018)
S. Mattia, F. Rossi, M. Servilio, S. Smriglio
Staffing and scheduling flexible call centers by two-stage robust optimization
Omega, 72, pp. 25-37 (2017)
B. Addis, G. Carello, S. Mattia
Survivable green traffic engineering with shared protection
Networks, 69(1), pp. 6-22 (2017)
S. Mattia
The cut property under demand uncertainty
Networks 66(2), pp. 159-168 (2015)
B. Addis, G. Carello, A. Grosso, E. Lanzarone, S. Mattia, E. Tanfani
Handling uncertainty in health care management using the cardinality-constrained approach: advantages and remarks
Operations Research for Health Care 4, pp. 1-4 (2015)
S. Mattia
A polyhedral study of the capacity formulation of the multilayer network design problem
Networks 62(1), pp. 17-26 (2013)
S. Mattia
The robust network loading problem with dynamic routing
Computational Optimization and Applications, 54(3), pp. 619-643 (2013)
S. Mattia
Separating tight metric inequalities by bilevel programming
Operations Research Letters, 40(6), pp. 568-572 (2012)
S. Mattia
Solving survivable two-layer network design problems by metric inequalities
Computational Optimization and Applications, 51(2), pp. 809-834 (2012)
C. Mannino, S. Mattia, A. Sassano
Planning wireless networks by shortest path
Computational Optimization and Applications 48(3), pp. 533-551 (2011)
F. Bonomo, S. Mattia, G. Oriolo
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Theoretical Computer Science 412(45), pp. 6261-6268 (2011)
P. Avella, S. Mattia, A. Sassano
Metric inequalities and the network loading problem
Discrete Optimization 4, pp. 103-114 (2007)
D. Bienstock, S. Mattia
Using mixed-integer programming to solve power grid blackout problems
Discrete Optimization 4, pp. 115-141 (2007)
Contributi in atti di conferenza
T. Bacci, S. Mattia, P. Ventura
A new lower bound for the Block Relocation Problem
Proceedings of the International Conference on Computational Logistics (ICCL), 2018
Lecture Notes in Computer Science 11184, pp. 168-174 (2018)
C. Arbib, P. Avella, M. Boccia, F. Marinelli, S. Mattia
Optimization models for cut sequencing
Proceedings of the International Conference on Optimization and Decision Science (ODS), 2017
PROMS 217, pp. 443-451 (2017)
S. Mattia
A polyhedral study of the robust capacitated edge activation problem
Proceedings of the Optimization and Decision Science (ODS) conference, 2017
PROMS 217, pp. 413-419 (2017)
T. Bacci, S. Mattia, P. Ventura
Some complexity results for the minimum blocking items problem
Proceedings of the International Conference on Optimization and Decision Science (ODS), 2017
PROMS 217, pp. 475-483 (2017)
B. Addis, G. Carello, S. Mattia
Energy-aware survivable networks
Proceedings of the International Network Optimization Conference (INOC), 2015
Electronic Notes in Discrete Mathematics 52, pp. 133-140 (2016)
S. Mattia
Benders decomposition for capacitated network design
Proceedings of the International Symposium on Combinatorial Optimization (ISCO), 2016
Lecture Notes in Computer Science 9849, pp. 71-80 (2016)
S. Mattia, F. Rossi, M. Servilio, S. Smriglio
Robust Shift Scheduling in Call Centers
Proceedings of the International Symposium on Combinatorial Optimization (ISCO), 2014
Lecture Notes in Computer Science 8596, pp. 16-32 (2014)
P. Avella, M. Boccia, S. Mattia
A branch-and-cut algorithm for the single source capacitated facility location problem
Proceedings of the International Conference on Advanced Logistics and Transport (ICALT), 2013
IEEEXplore, DOI 10.1109/ICAdLT.2013.6568456 (2013)
P. Avella, M. Boccia, S. Mattia
Mixed integer lifted cover inequalities for knapsack problems with a single continuous variable
Proceedings of the 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), 2013
IEEEXplore, DOI 10.1109/ICMSAO.2013.6552649 (2013)
S. Mattia
The cut condition for robust network design
Proceedings of the International Network Optimization Conference (INOC), 2013
Electronic Notes in Discrete Mathematics 41, pp. 303-310 (2013)
S. Mattia
The two layer network design problem
Proceedings of the International Network Optimization Conference (INOC), 2011
Lecture Notes in Computer Science 6701, pp. 145-149 (2011)
P. Avella, S. Mattia, A. Sassano
Metric inequalities and the network loading problem
Proceedings of the Integer Programming and Combinatorial Optimization (IPCO) conference, 2004
Lecture Notes in Computer Science 3064, pp. 16-32 (2004)
Capitoli di libri
T. Bacci, S. Conte, D. Matera, S. Mattia, P. Ventura
A New Software System for Optimizing the Operations at a Container Terminal
A View of Operations Research
Applications in Italy, 2018. AIRO Springer Series 2, pp. 41-50. Springer, Cham (2019)
Brevetti
G. Bernardi, M. Boccia, S. Mattia, P. Avella
Procedimento per il bilanciamento di percorsi di routing attraverso una rete dati, relativo sistema di comunicazione e prodotto
informatico
Brevetto per invenzione industriale n. 102017000007295, 19 agosto 2019 (deposito domanda 24 gennaio 2017)
EOLO S.p.A.
Coordinatrice di progetti di ricerca
Progetti di ricerca GNAMPA-INδAM 2024: Ottimizzazione con decisori multipli e incertezza nei dati
Progetti di ricerca GNAMPA-INδAM 2022: Ottimizzazione con incertezza
Progetti di ricerca GNAMPA-INδAM 2020: Ottimizzazione bilivello