The following pages link to (Q4845372):
Displayed 33 items.
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs (Q860392) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- On the two-connected planar spanning subgraph polytope (Q1382280) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- Splitting off edges between two subsets preserving the edge-connectivity of the graph. (Q1422410) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- On shortest three-edge-connected Steiner networks with Euclidean distance (Q1570830) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Approximating unweighted connectivity problems in parallel (Q1854474) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- A cutting plane algorithm for computing \(k\)-edge survivability of a network (Q1877897) (← links)
- A bootstrap heuristic for designing minimum cost survivable networks (Q1919975) (← links)
- On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)
- The multi-layered network design problem (Q2370332) (← links)
- Separation of partition inequalities with terminals (Q2386198) (← links)
- The swap edges of a multiple-sources routing tree (Q2479532) (← links)
- Two-connected Steiner networks: structural properties (Q2488236) (← 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)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- Network disconnection problems in a centralized network (Q5386379) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)
- Bipartition constrained edge-splitting in directed graphs (Q5954237) (← links)