Metric inequalities and the Network Loading Problem. - Pasquale Avella; Sara Mattia; Antonio Sassano (Discret. Optim., 2007)

Using mixed-integer programming to solve power grid blackout problems. - Daniel Bienstock; Sara Mattia (Discret. Optim., 2007)

The Two Layer Network Design Problem. - Sara Mattia (INOC, 2011)

Planning wireless networks by shortest path. - Carlo Mannino; Sara Mattia; Antonio Sassano (Comput. Optim. Appl., 2011)

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. - Flavia Bonomo; Sara Mattia; Gianpaolo Oriolo (Theor. Comput. Sci., 2011)

Solving survivable two-layer network design problems by metric inequalities. - Sara Mattia (Comput. Optim. Appl., 2012)

Separating tight metric inequalities by bilevel programming. - Sara Mattia (Oper. Res. Lett., 2012)

The robust network loading problem with dynamic routing. - Sara Mattia (Comput. Optim. Appl., 2013)

The cut condition for robust network design. - Sara Mattia (Electron. Notes Discret. Math., 2013)

A polyhedral study of the capacity formulation of the multilayer network design problem. - Sara Mattia (Networks, 2013)

Robust Shift Scheduling in Call Centers. - Sara Mattia; Fabrizio Rossi; Mara Servilio; Stefano Smriglio (ISCO, 2014)

The cut property under demand uncertainty. - Sara Mattia (Networks, 2015)

Benders Decomposition for Capacitated Network Design. - Sara Mattia (ISCO, 2016)

Energy-aware survivable networks. - Bernardetta Addis; Giuliana Carello; Sara Mattia (Electron. Notes Discret. Math., 2016)

Survivable green traffic engineering with shared protection. - Bernardetta Addis; Giuliana Carello; Sara Mattia (Networks, 2017)

A New Lower Bound for the Block Relocation Problem. - Tiziano Bacci; Sara Mattia; Paolo Ventura (ICCL, 2018)

A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation. - Sara Mattia; Michael Poss (Comput. Optim. Appl., 2018)

The capacity formulation of the capacitated edge activation problem. - Sara Mattia (Networks, 2018)

The bounded beam search algorithm for the block relocation problem. - Tiziano Bacci; Sara Mattia; Paolo Ventura (Comput. Oper. Res., 2019)

An optimization approach for congestion control in network routing with quality of service requirements. - Pasquale Avella; Giacomo Bernardi; Maurizio Boccia; Sara Mattia (Networks, 2019)

A polyhedral analysis of the capacitated edge activation problem with uncertain demands. - Sara Mattia (Networks, 2019)

MIP-based heuristic approaches for the capacitated edge activation problem: the effect of non-compactness. - Sara Mattia (Soft Comput., 2019)

A branch-and-cut algorithm for the restricted Block Relocation Problem. - Tiziano Bacci; Sara Mattia; Paolo Ventura (Eur. J. Oper. Res., 2020)

Weak flow cover inequalities for the capacitated facility location problem. - Pasquale Avella; Maurizio Boccia; Sara Mattia; Fabrizio Rossi (Eur. J. Oper. Res., 2021)

The realization-independent reallocation heuristic for the stochastic container relocation problem. - Tiziano Bacci; Sara Mattia; Paolo Ventura (Soft Comput., 2023)

The follower optimality cuts for mixed integer linear bilevel programming problems. - Sara Mattia (Soft Comput., 2023)

Reformulations and complexity of the clique interdiction problem by graph mapping. - Sara Mattia (Discret. Appl. Math., 2024)