Pages that link to "Item:Q2576774"
From MaRDI portal
The following pages link to The 2-edge-connected subgraph polyhedron (Q2576774):
Displaying 10 items.
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (Q839668) (← links)
- Packing circuits in matroids (Q1013971) (← links)
- Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
- Box-total dual integrality and edge-connectivity (Q2689821) (← links)
- Survivability in hierarchical telecommunications networks (Q2892145) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)