SNDlib
From MaRDI portal
Cited in
(93)- A New Necessary Condition for Shortest Path Routing
- 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
- 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 capacity assignment solutions for telecommunications networks with uncertain demands
- 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
- Constraint games for stable and optimal allocation of demands in SDN
- Stochastic RWA and lightpath rerouting in WDM networks
- Chance-constrained optimization of reliable fixed broadband wireless networks
- Optimal capacitated ring trees
- Optimizing flow thinning protection in multicommodity networks with variable link capacity
- Single-commodity robust network design with finite and hose demand sets
- Models for the piecewise linear unsplittable multicommodity flow problems
- 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
- The minimum cost network upgrade problem with maximum robustness to multiple node failures
- Preprocessing and cutting planes with conflict graphs
- 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
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
- 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
- SteinLib
- TTPLib
- Zimpl
- LEMON
- mkc7
- RAPTOR
- SONET
- Tttplots-compare
- OsiSolver
- PySCIPOpt
- TOTEM
- CuSPLIB
- MULTILSB
- LINERLIB
- GreedyBB
- ACTS
- 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
- strIPlib
- A practicable robust counterpart formulation for decomposable functions: a network congestion case study
- SearchCol
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Mixed integer non-linear programming models for green network design
- Single-path routing of stochastic flows in networks
- Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
- Single source single-commodity stochastic network design
- A comparison of routing sets for robust network design
- Survivable network design with demand uncertainty
- Single-commodity network design with random edge capacities
- An iterative security game for computing robust and adaptive network flows
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- 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
- Robust network design: formulations, valid inequalities, and computations
- Improved formulations for the ring spur assignment problem
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
- Solving network design problems via iterative aggregation
- Fractional routing using pairs of failure-disjoint paths
- Mitigating interdiction risk with fortification
- Robust network design with uncertain outsourcing cost
- An approximation to max min fairness in multi commodity networks
- The robust network loading problem with dynamic routing
- An exact approach for the multicommodity network optimization problem with a step cost function
- Towards optimizing the deployment of optical access networks
- Valid cycles: A source of infeasibility in open shortest path first routing
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
- Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach
- Separating tight metric inequalities by bilevel programming
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- 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
- EETTlib
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
This page was built for software: SNDlib
