Sara Mattia
Sara Mattia Sara Mattia
Researcher

Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti"
Via dei Taurini, 19
00185 Roma - Italy

Office n. 514
Tel.: +39 06 4993 7130
Fax: +39 06 4993 7137
Personal web page: http://www.iasi.cnr.it/~smattia
email

Research interests

Integer Programming, Bilevel Programming, Robust Optimization, Network Design, Combinatorial Optimization,


Research groups

Selected publications
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: The realization-independent reallocation heuristic for the stochastic container relocation problem, Soft Computing 27, 4223-4233, 2023
  • Sara Mattia: The follower optimality cuts for mixed integer linear bilevel programming problems, Soft Computing 27, 11529-11550, 2023
  • Avella P., Boccia M., Sara Mattia, Rossi F.: Weak Flow Cover Inequalities for the Capacitated Facility Location Problem, European Journal of Operational Research 289, 485-494, 2021
  • Sara Mattia: Reformulations and complexity of the clique interdiction problem by graph mapping, Discrete Applied Mathematics in press, DOI 10.1016/j.dam.2021.06.008, 2021
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: A Branch and Cut algorithm for the Restricted Block Relocation Problem, European Journal of Operational Research 287, 452-459, 2020
  • Avella P., Bernardi G., Boccia M., Sara Mattia: An optimization approach for congestion control in network routing with quality of service requirements, Networks 74, 124-133, 2019
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: The Bounded Beam Search algorithm for the Block Relocation Problem, Computers & Operations Research 103, 252-264, 2019
  • Bernardi G., Boccia M., Sara Mattia, Avella P.: 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., 2019
  • Sara Mattia: A polyhedral analysis of the capacitated edge activation problem with uncertain demands, Networks 74, 190-204, 2019
  • Sara Mattia: MIP-based heuristic approaches for the capacitated edge activation problem: the effect of non-compactness, Soft Computing 23(9), 2911-2921, 2019
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: A new lower bound for the Block Relocation Problem, in the Proceedings of ICCL 2018, Lecture Notes in Computer Science, 11184, pp. 168–174, 2018
  • Carello G., Lanzarone E., Sara Mattia: Trade-off between stakeholders' goals in the home care nurse-to-patient assignment problem, Operations Research for Health Care 16, 29-40, 2018
  • Sara Mattia: The capacity formulation of the capacitated edge activation problem, Networks 71(4), 381-402, 2018
  • Sara Mattia, Poss M.: A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, Computational Optimization and Applications 69, 753-800, 2018
  • Addis B., Carello G., Sara Mattia: Survivable Green Traffic Engineering with Shared Protection, Networks 69(1), 6-22, 2017
  • Arbib C., Avella P., Boccia M., Marinelli F., Sara Mattia: Optimization Models for Cut Sequencing, in the Proceedings of ODS 2017, Springer Proceedings in Mathematics & Statistics, 217, pp. 443-451, 2017
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: Some Complexity Results for the Minimum Blocking Items Problem, in the Proceedings of ODS 2017, Springer Proceedings in Mathematics & Statistics, 217, pp. 475-483, 2017
  • Sara Mattia: A Polyhedral Study of the Robust Capacitated Edge Activation Problem, in the Proceedings of ODS 2017, Springer Proceedings in Mathematics & Statistics, 217, pp. 413-419, 2017
  • Sara Mattia, Rossi F., Servilio M., Smriglio S.: Staffing and Scheduling Flexible Call Centers by Two-Stage Robust Optimization, Omega-International Journal of Management Science 72, 25-37, 2017
  • Addis B., Carello G., Grosso A., Lanzarone E., Sara Mattia, Tanfani E.: Handling uncertainty in health care management using the cardinality-constrained approach: Advantages and remarks, Operations Research for Health Care 4, 1-4, 2015
  • Sara Mattia: The cut property under demand uncertainty, Networks 66(2), 159-168, 2015
  • Avella P., Boccia M., Sara Mattia: A Branch-and-Cut algorithm for the Single Source Capacitated Facility Location problem, in the Proceedings of Advanced Logistics and Transport (ICALT), 2013 International Conference on, IEEEXplore, DOI 10.1109/ICAdLT.2013.6568456, 2013
  • Avella P., Boccia M., Sara Mattia: Mixed Integer Lifted Cover Inequalities for Knapsack Problems with a Single Continuous Variable, in the Proceedings of 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO) 2013, IEEEXplore, DOI 10.1109/ICMSAO.2013.6552649, 2013
  • Sara Mattia: A Polyhedral Study of the Capacity Formulation of the Multilayer Network Design Problem, Networks 62(1), 17-26, 2013
  • Sara Mattia: The Robust Network Loading Problem with Dynamic Routing, Computational Optimization and Applications 54(3), 619-643, 2013
  • Sara Mattia: Separating Tight Metric Inequalities by Bilevel Programming, Operations Research Letters 40(6), 568-572, 2012
  • Sara Mattia: Solving Survivable Two-Layer Network Design Problems by Metric Inequalities, Computational Optimization and Applications 51(2), 809-834, 2012
  • Bonomo F., Sara Mattia, Oriolo G.: Bounded Coloring of co-Comparability Graphs and the Pickup and Delivery Tour Combination Problem, Theoretical Computer Science 412(45), 6261-6268, 2011
  • Mannino C., Sara Mattia, Sassano A.: Planning Wireless Networks by Shortest Path, Computational Optimization and Applications 48(3), 533-551, 2011
  • Avella P., Sara Mattia, Sassano A.: Metric Inequalities and the Network Loading Problem, Discrete Optimization 4, 103-114, 2007
  • Bienstock D., Sara Mattia: Using Mixed-Integer Programming to Solve Power Grid Blackout Problems, Discrete Optimization 4, 115-141, 2007
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -