Pages that link to "Item:Q1849257"

The following pages link to Polyhedral results for two-connected networks with bounded rings (Q1849257):

Displaying 13 items.

• The embedding of rings and meshes into \(\text{RP} (k)\) networks (Q866115) (← links)
• Two-connected networks with rings of bounded cardinality (Q1424779) (← links)
• Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
• Networks with unicyclic connected components and without short cycles (Q2861517) (← links)
• Steiner networks with unicyclic connected components (Q2861518) (← links)
• Survivability in hierarchical telecommunications networks (Q2892145) (← links)
• The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (Q3418127) (← links)
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
• A characterization of network representable polymatroids (Q5202490) (← links)
• A Network Design Problem with Two-Edge Matching Failures (Q5247694) (← links)
• A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
• Network design with vulnerability constraints and probabilistic edge reliability (Q6599059) (← links)