SNDlib
From MaRDI portal
Software:13628
swMATH884MaRDI QIDQ13628FDOQ13628
Author name not available (Why is that?)
Cited In (74)
- A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study
- Mitigating Interdiction Risk with Fortification
- The minimum cost network upgrade problem with maximum robustness to multiple node failures
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
- 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
- An iterative security game for computing robust and adaptive network flows
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
- 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 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
- Robust Network Design with Uncertain Outsourcing Cost
- 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
- Constraint games for stable and optimal allocation of demands in SDN
- Optimal capacitated ring trees
- Models for the piecewise linear unsplittable multicommodity flow problems
- 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
- Robust network design: Formulations, valid inequalities, and computations
- Solving survivable two-layer network design problems by metric inequalities
- Cutset Inequalities for Robust Network Design
- Proximity search for 0--1 mixed-integer convex programming
- Preprocessing and cutting planes with conflict graphs
- 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
- Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks
- Integer programming formulations for the elementary shortest path problem
- Distributed monitoring problem
- Hierarchical survivable network design problems
- Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
- Mixed integer non-linear programming models for green network design
- Affine recourse for the robust network design problem: Between static and dynamic routing
- 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 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
- Solving network design problems via iterative aggregation
- Fractional routing using pairs of failure-disjoint paths
- Optimization of OSPF Routing in IP Networks
- 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
- Stochastic RWA and Lightpath Rerouting in WDM Networks
- 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
- On cut-based inequalities for capacitated network design polyhedra
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity
- Improved Formulations for the Ring Spur Assignment Problem
This page was built for software: SNDlib