Pages that link to "Item:Q1977866"
From MaRDI portal
The following pages link to Steiner \(k\)-edge connected subgraph polyhedra (Q1977866):
Displaying 14 items.
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs (Q705040) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- A hybrid optimization approach for the Steiner \(k\)-connected network design problem (Q1742248) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Box-total dual integrality and edge-connectivity (Q2689821) (← links)
- On Steiner 2-edge connected polytopes (Q2816114) (← links)
- Minimum cost \(\leq k\) edges connected subgraph problems (Q2883545) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems (Q4018843) (← links)
- Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)
- On the dominant of the Steiner 2-edge connected subgraph polytope (Q5946813) (← links)
- Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)
- Design of survivable networks with low connectivity requirements (Q6659118) (← links)
