Pages that link to "Item:Q3352817"

The following pages link to Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints (Q3352817):

Displaying 35 items.

• Survivable network design with shared-protection routing (Q296897) (← links)
• The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
• Minimum-weight two-connected spanning networks (Q582215) (← links)
• Survivable network design with demand uncertainty (Q631096) (← links)
• Directed Steiner problems with connectivity constraints (Q1315992) (← links)
• Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
• On perfectly two-edge connected graphs (Q1363658) (← links)
• A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach (Q1370717) (← links)
• The Steiner tree packing problem in VLSI design (Q1373751) (← links)
• On finding two-connected subgraphs in planar graphs (Q1376267) (← 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)
• Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
• On survivable network polyhedra (Q1772416) (← links)
• The Steiner cycle polytope (Q1873013) (← links)
• The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298) (← links)
• Packing Steiner trees: Polyhedral investigations (Q1919089) (← links)
• Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
• Separation of partition inequalities with terminals (Q2386198) (← links)
• Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
• The Steiner connectivity problem (Q2434988) (← 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)
• Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
• Box-total dual integrality and edge-connectivity (Q2689821) (← links)
• Minimum Cost ≤k Edges Connected Subgraph Problems (Q2883545) (← links)
• Facet Generating Techniques (Q2971603) (← links)
• A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
• Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
• On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
• (Q5708500) (← links)
• Probabilistic properties of highly connected random geometric graphs (Q5919114) (← links)
• Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
• A deep real options policy for sequential service region design and timing (Q6065667) (← links)