Pages that link to "Item:Q1330901"

The following pages link to Two-edge connected spanning subgraphs and polyhedra (Q1330901):

Displaying 36 items.

• A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
• Minimum-weight two-connected spanning networks (Q582215) (← links)
• Design of survivable IP-over-optical networks (Q863570) (← links)
• The box-TDI system associated with 2-edge connected spanning subgraphs (Q1003761) (← links)
• The Steiner tree polytope and related polyhedra (Q1322552) (← links)
• Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
• Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
• 2-connected spanning subgraphs of planar 3-connected graphs (Q1333340) (← links)
• On perfectly two-edge connected graphs (Q1363658) (← links)
• On the two-connected planar spanning subgraph polytope (Q1382280) (← links)
• The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
• On survivable network polyhedra (Q1772416) (← links)
• Generalized network design problems. (Q1810478) (← links)
• On two-connected subgraph polytopes (Q1910503) (← links)
• The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298) (← links)
• Steiner \(k\)-edge connected subgraph polyhedra (Q1977866) (← links)
• Separation of partition inequalities with terminals (Q2386198) (← links)
• Spanning cactus: complexity and extensions (Q2410246) (← links)
• The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)
• \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
• The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
• Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
• Box-total dual integrality and edge-connectivity (Q2689821) (← links)
• Minimum cost \(\leq k\) edges connected subgraph problems (Q2883545) (← links)
• Survivability in hierarchical telecommunications networks (Q2892145) (← links)
• Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
• Facet Generating Techniques (Q2971603) (← 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)
• A Network Design Problem with Two-Edge Matching Failures (Q5247694) (← links)
• Optimization in telecommunication networks (Q5313481) (← links)
• (Q5703678) (← links)
• On the dominant of the Steiner 2-edge connected subgraph polytope (Q5946813) (← links)
• Design of survivable networks with low connectivity requirements (Q6659118) (← links)