SNDlib

swMATH884MaRDI QIDQ13628

No author found.

Related Items (74)

Optimal capacitated ring trees ⋮ Single-commodity robust network design with finite and hose demand sets ⋮ Survivable network design with shared-protection routing ⋮ The robust network loading problem with dynamic routing ⋮ Stochastic RWA and Lightpath Rerouting in WDM Networks ⋮ A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm ⋮ An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks ⋮ Robust Network Design with Uncertain Outsourcing Cost ⋮ Integer programming formulations for the elementary shortest path problem ⋮ Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice ⋮ Distributed monitoring problem ⋮ Hierarchical survivable network design problems ⋮ Network design in scarce data environment using moment-based distributionally robust optimization ⋮ The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach ⋮ Stochastic maximum flow interdiction problems under heterogeneous risk preferences ⋮ Mixed integer non-linear programming models for green network design ⋮ Robust energy-aware routing with redundancy elimination ⋮ On the hop-constrained survivable network design problem with reliable edges ⋮ Network loading problem: valid inequalities from 5- and higher partitions ⋮ Robust network design: Formulations, valid inequalities, and computations ⋮ Affine recourse for the robust network design problem: Between static and dynamic routing ⋮ Benders decomposition approach for the robust network design problem with flow bifurcations ⋮ Single source single-commodity stochastic network design ⋮ Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks ⋮ The minimum cost network upgrade problem with maximum robustness to multiple node failures ⋮ An iterative security game for computing robust and adaptive network flows ⋮ Single-commodity network design with random edge capacities ⋮ An approximation to max min fairness in multi commodity networks ⋮ Separating tight metric inequalities by bilevel programming ⋮ Survivable network design with demand uncertainty ⋮ A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem ⋮ Solving survivable two-layer network design problems by metric inequalities ⋮ Mitigating Interdiction Risk with Fortification ⋮ A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines ⋮ A comparison of routing sets for robust network design ⋮ Valid cycles: A source of infeasibility in open shortest path first routing ⋮ Fractional routing using pairs of failure-disjoint paths ⋮ Computing and maximizing the exact reliability of wireless backhaul networks ⋮ \(k\)-adaptive routing for the robust network loading problem ⋮ Path generation for affine flow thinning ⋮ A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation ⋮ Models for the piecewise linear unsplittable multicommodity flow problems ⋮ Proximity search for 0--1 mixed-integer convex programming ⋮ A decomposition algorithm for the ring spur assignment problem ⋮ Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity ⋮ Constraint games for stable and optimal allocation of demands in SDN ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ An integer programming algorithm for routing optimization in IP networks ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Single-path routing of stochastic flows in networks ⋮ Preprocessing and cutting planes with conflict graphs ⋮ Experiments on virtual private network design with concave capacity costs ⋮ Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study ⋮ Decomposition for adjustable robust linear optimization subject to uncertainty polytope ⋮ A New Necessary Condition for Shortest Path Routing ⋮ Towards optimizing the deployment of optical access networks ⋮ Solving network design problems via iterative aggregation ⋮ On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics ⋮ Robust capacity assignment solutions for telecommunications networks with uncertain demands ⋮ On cut-based inequalities for capacitated network design polyhedra ⋮ Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach ⋮ A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study ⋮ Population-based risk equilibration for the multimode hazmat transport network design problem ⋮ An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron ⋮ Enhancing label space usage for ethernet VLAN-label switching ⋮ Robust routing and optimal partitioning of a traffic demand polytope ⋮ Improved Formulations for the Ring Spur Assignment Problem ⋮ Cutset Inequalities for Robust Network Design ⋮ Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization ⋮ Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems ⋮ Optimization of OSPF Routing in IP Networks ⋮ An improved Benders decomposition applied to a multi-layer network design problem ⋮ An exact approach for the multicommodity network optimization problem with a step cost function

This page was built for software: SNDlib