Pages that link to "Item:Q3057129"

The following pages link to A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129):

Displaying 9 items.

• The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (Q325409) (← links)
• The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
• Box-total dual integrality and edge-connectivity (Q2689821) (← links)
• Survivability in hierarchical telecommunications networks (Q2892145) (← links)
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
• Probabilistic properties of highly connected random geometric graphs (Q5919114) (← links)
• Network design with vulnerability constraints and probabilistic edge reliability (Q6599059) (← links)
• Design of survivable networks with low connectivity requirements (Q6659118) (← links)