Pages that link to "Item:Q1698886"
From MaRDI portal
The following pages link to Design of survivable networks with vulnerability constraints (Q1698886):
Displaying 6 items.
- Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
- Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- Graph fragmentation problem: analysis and synthesis (Q6066278) (← links)
