Pages that link to "Item:Q1430376"

The following pages link to The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376):

Displayed 4 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)
• A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) ‎ (← links)
• On the Steiner 2-edge connected subgraph polytope (Q3598034) ‎ (← links)