Sara Mattia

Orcid: 0000-0001-5054-731X

According to our database1, Sara Mattia authored at least 26 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The follower optimality cuts for mixed integer linear bilevel programming problems.
Soft Comput., August, 2023

The realization-independent reallocation heuristic for the stochastic container relocation problem.
Soft Comput., April, 2023

2021
Weak flow cover inequalities for the capacitated facility location problem.
Eur. J. Oper. Res., 2021

2020
A branch-and-cut algorithm for the restricted Block Relocation Problem.
Eur. J. Oper. Res., 2020

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

A polyhedral analysis of the capacitated edge activation problem with uncertain demands.
Networks, 2019

An optimization approach for congestion control in network routing with quality of service requirements.
Networks, 2019

The bounded beam search algorithm for the block relocation problem.
Comput. Oper. Res., 2019

2018
The capacity formulation of the capacitated edge activation problem.
Networks, 2018

A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation.
Comput. Optim. Appl., 2018

A New Lower Bound for the Block Relocation Problem.
Proceedings of the Computational Logistics - 9th International Conference, 2018

2017
Survivable green traffic engineering with shared protection.
Networks, 2017

2016
Energy-aware survivable networks.
Electron. Notes Discret. Math., 2016

Benders Decomposition for Capacitated Network Design.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
The cut property under demand uncertainty.
Networks, 2015

2014
Robust Shift Scheduling in Call Centers.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
A polyhedral study of the capacity formulation of the multilayer network design problem.
Networks, 2013

The cut condition for robust network design.
Electron. Notes Discret. Math., 2013

The robust network loading problem with dynamic routing.
Comput. Optim. Appl., 2013

2012
Separating tight metric inequalities by bilevel programming.
Oper. Res. Lett., 2012

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

2011
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem.
Theor. Comput. Sci., 2011

Planning wireless networks by shortest path.
Comput. Optim. Appl., 2011

The Two Layer Network Design Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2007
Using mixed-integer programming to solve power grid blackout problems.
Discret. Optim., 2007

Metric inequalities and the Network Loading Problem.
Discret. Optim., 2007


  Loading...