The following pages link to Sara Mattia (Q325415):
Displaying 23 items.
- Energy-aware survivable networks (Q325416) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- (Q538305) (redirect page) (← links)
- Planning wireless networks by shortest path (Q538307) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- The bounded beam search algorithm for the block relocation problem (Q1634080) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- A branch-and-cut algorithm for the restricted block relocation problem (Q2023911) (← links)
- Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- Using mixed-integer programming to solve power grid blackout problems (Q2471280) (← links)
- Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
- The Two Layer Network Design Problem (Q3091495) (← links)
- Robust Shift Scheduling in Call Centers (Q3195343) (← links)
- Survivable green traffic engineering with shared protection (Q4565768) (← links)
- The capacity formulation of the capacitated edge activation problem (Q4584869) (← links)
- The cut property under demand uncertainty (Q4642447) (← links)
- A polyhedral analysis of the capacitated edge activation problem with uncertain demands (Q5194730) (← links)
- A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
- Integer Programming and Combinatorial Optimization (Q5712458) (← links)
- Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672) (← links)
