The following pages link to SNDlib (Q13628):
Displaying 50 items.
- Optimal capacitated ring trees (Q286687) (← links)
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Survivable network design with shared-protection routing (Q296897) (← links)
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- Distributed monitoring problem (Q325372) (← links)
- Hierarchical survivable network design problems (Q325448) (← links)
- Mixed integer non-linear programming models for green network design (Q339579) (← links)
- Robust energy-aware routing with redundancy elimination (Q342072) (← links)
- On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
- Single source single-commodity stochastic network design (Q373182) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- A comparison of routing sets for robust network design (Q479214) (← links)
- Fractional routing using pairs of failure-disjoint paths (Q496701) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
- An integer programming algorithm for routing optimization in IP networks (Q547285) (← links)
- Survivable network design with demand uncertainty (Q631096) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Experiments on virtual private network design with concave capacity costs (Q723484) (← links)
- Enhancing label space usage for ethernet VLAN-label switching (Q1017496) (← links)
- An improved Benders decomposition applied to a multi-layer network design problem (Q1038109) (← links)
- Network design in scarce data environment using moment-based distributionally robust optimization (Q1651520) (← links)
- The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (Q1651527) (← links)
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences (Q1652509) (← links)
- Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)
- Computing and maximizing the exact reliability of wireless backhaul networks (Q1742207) (← links)
- \(k\)-adaptive routing for the robust network loading problem (Q1742208) (← links)
- Path generation for affine flow thinning (Q1742256) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- Models for the piecewise linear unsplittable multicommodity flow problems (Q1753554) (← links)
- Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (Q1789594) (← links)
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope (Q1789596) (← links)
- Single-commodity network design with random edge capacities (Q1926752) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- Constraint games for stable and optimal allocation of demands in SDN (Q2009195) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← links)
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374) (← links)
- An approximation to max min fairness in multi commodity networks (Q2183560) (← links)
- Single-path routing of stochastic flows in networks (Q2275571) (← links)
- Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach (Q2300647) (← links)
- Population-based risk equilibration for the multimode hazmat transport network design problem (Q2301954) (← links)
- Designing networks with resiliency to edge failures using two-stage robust optimization (Q2315627) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- Solving network design problems via iterative aggregation (Q2516352) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- The minimum cost network upgrade problem with maximum robustness to multiple node failures (Q2669557) (← links)
- An iterative security game for computing robust and adaptive network flows (Q2669664) (← links)
