The following pages link to (Q4035361):
Displayed 19 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)
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (Q839668) (← links)
- Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- A cutting plane algorithm for computing \(k\)-edge survivability of a network (Q1877897) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298) (← links)
- A bootstrap heuristic for designing minimum cost survivable networks (Q1919975) (← links)
- \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
- Probabilistic properties of highly connected random geometric graphs (Q5919114) (← links)
- On the dominant of the Steiner 2-edge connected subgraph polytope (Q5946813) (← links)