SNDlib

swMATH884MaRDI QIDQ13628FDOQ13628

Author name not available (Why is that?)

Official website: http://sndlib.zib.de/home.action

Cited In (90)

• Computing and maximizing the exact reliability of wireless backhaul networks
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• Cutset inequalities for robust network design
• Robust capacity assignment solutions for telecommunications networks with uncertain demands
• An integer programming algorithm for routing optimization in IP networks
• Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
• Robust routing and optimal partitioning of a traffic demand polytope
• Benders decomposition approach for the robust network design problem with flow bifurcations
• \(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
• Chance-constrained optimization of reliable fixed broadband wireless networks
• Optimizing flow thinning protection in multicommodity networks with variable link capacity
• Optimal capacitated ring trees
• Single-commodity robust network design with finite and hose demand sets
• Experiments on virtual private network design with concave capacity costs
• Survivable network design with shared-protection routing
• Solving survivable two-layer network design problems by metric inequalities
• Proximity search for 0--1 mixed-integer convex programming
• Optimization of OSPF routing in IP networks
• Population-based risk equilibration for the multimode hazmat transport network design problem
• A decomposition algorithm for the ring spur assignment problem
• 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
• Network loading problem: valid inequalities from 5- and higher partitions
• Enhancing label space usage for ethernet VLAN-label switching
• Integer programming formulations for the elementary shortest path problem
• Distributed monitoring problem
• Hierarchical survivable network design problems
• LEMON
• mkc7
• RAPTOR
• SONET
• Tttplots-compare
• OsiSolver
• PySCIPOpt
• TOTEM
• CuSPLIB
• SearchCol
• Mixed integer non-linear programming models for green network design
• Single source single-commodity stochastic network design
• MULTILSB
• LINERLIB
• GreedyBB
• A comparison of routing sets for robust network design
• Survivable network design with demand uncertainty
• Single-commodity network design with random edge capacities
• ACTS
• Robust network design: formulations, valid inequalities, and computations
• On the hop-constrained survivable network design problem with reliable edges
• Robust energy-aware routing with redundancy elimination
• An improved Benders decomposition applied to a multi-layer network design problem
• Improved formulations for the ring spur assignment problem
• Solving network design problems via iterative aggregation
• Fractional routing using pairs of failure-disjoint paths
• Robust network design with uncertain outsourcing cost
• An exact approach for the multicommodity network optimization problem with a step cost function
• The robust network loading problem with dynamic routing
• Valid cycles: A source of infeasibility in open shortest path first routing
• Towards optimizing the deployment of optical access networks
• A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
• Separating tight metric inequalities by bilevel programming
• Designing networks with resiliency to edge failures using two-stage robust optimization
• Affine recourse for the robust network design problem: between static and dynamic routing
• On cut-based inequalities for capacitated network design polyhedra
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
• Stochastic RWA and lightpath rerouting in WDM networks
• Constraint games for stable and optimal allocation of demands in SDN
• Models for the piecewise linear unsplittable multicommodity flow problems
• strIPlib
• The minimum cost network upgrade problem with maximum robustness to multiple node failures
• Preprocessing and cutting planes with conflict graphs
• An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
• A practicable robust counterpart formulation for decomposable functions: a network congestion case study
• On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
• Single-path routing of stochastic flows in networks
• Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
• An iterative security game for computing robust and adaptive network flows
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
• EETTlib
• Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
• Mitigating interdiction risk with fortification
• An approximation to max min fairness in multi commodity networks
• Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach
• A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
• A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem
• A New Necessary Condition for Shortest Path Routing

This page was built for software: SNDlib