#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2004

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Pasquale Avella, Sara Mattia, Antonio Sassano
- Discrete Optimization
- 2004

Given a simple graph G(V, E) and a set of traffic demands between the nodes of G, the Network Loading Problem consists of installing minimum cost integer capacities on the edges of G allowing routing of traffic demands. In this paper we study the Capacity Formulation of the Network Loading Problem, introducing the new class of Tight Metric Inequalities,â€¦ (More)

- Sara Mattia
- Comp. Opt. and Appl.
- 2013

The Robust Network Loading Problem (RNL) can be stated as follows. Given a graph and a set of traffic matrices, install minimum cost integer capacities on the edges such that all the matrices can be routed non simultaneously on the network. The routing scheme is said to be dynamic if we can choose a (possibly) different routing for every matrix, it isâ€¦ (More)

- Flavia Bonomo, Sara Mattia, Gianpaolo Oriolo
- Theor. Comput. Sci.
- 2011

The Double Traveling Salesman Problem with Multiple Stacks is a vehicle routing problem in which pickups and deliveries must be performed in two independent networks. The items are stored in stacks and repacking is not allowed. Given a pickup and a delivery tour, the problem of checking if there exists a valid distribution of items into s stacks of size hâ€¦ (More)

- Daniel Bienstock, Sara Mattia
- Discrete Optimization
- 2007

We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks subject to multiple scenarios of externally caused damage. We present computation with networks with up to 600 nodes and 827 edges, and many thousands of damage scenarios. 1 Partially funded by NSF award 0521741.

- Sara Mattia
- Oper. Res. Lett.
- 2012

We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks subject to multiple scenarios of externally caused damage. We present computation with networks with up to 600 nodes and 827 edges, and many thousands of damage scenarios. 1 Partially funded by NSF award DMI-0521741.

- Sara Mattia, Fabrizio Rossi, Mara Servilio, Stefano Smriglio
- ISCO
- 2014

- Pasquale Avella, Maurizio Boccia, Sara Mattia
- 2013 International Conference on Advancedâ€¦
- 2013

Several Mixed Integer Linear Programming problems present a formulation based on a great number of knapsack constraints. Problems widely addressed in literature with this structure are, among others, Generalized Assignment, Multiple Knapsack, Bin Packing, Capacitated P-median and Single Source Capacitated Facility Location. In general knapsack constraintsâ€¦ (More)

- Sara Mattia
- Networks
- 2015

- â€œAntonio Ruberti, CONSIGLIO NAZIONALE, DELLE RICERCHE, Sara Mattia, Sara Mattia
- 2011

The first exact approach to separate tight metric inequalities for the Network Loading problem is presented. A bilevel programming formulation for the separation problem is given, an algorithm is developed and computational results are discussed.