Pages that link to "Item:Q1430376"

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

Displaying 10 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 large class of facets for the \(K\)-median polytope (Q543406) (← links)
• Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (Q839668) (← links)
• On the linear relaxation of the 2-node connected subgraph polytope (Q1302172) (← links)
• Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
• Box-total dual integrality and edge-connectivity (Q2689821) (← 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)
• Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems (Q4018843) (← links)