Strong formulations for network design problems with connectivity requirements
From MaRDI portal
Recommendations
Cites work
Cited in
(37)- Hop-constrained node survivable network design: An application to MPLS over WDM
- A hybrid optimization approach for the Steiner k-connected network design problem
- Formulations for designing robust networks. An application to wind power collection
- Stochastic survivable network design problems: theory and practice
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem
- Topology design for on-demand dual-path routing in wireless networks
- Solving the optimum communication spanning tree problem
- Stronger MIP formulations for the Steiner forest problem
- On the chance-constrained minimum spanning \(k\)-core problem
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment
- Heuristics for the network design problem with connectivity requirements
- Strong lower bounds for a survivable network design problem
- Survivability in hierarchical telecommunications networks under dual homing
- Polyhedral structure of the 4-node network design problem
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- Hierarchical survivable network design problems
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- A branch-and-cut algorithm for two-level survivable network design problems
- An Exact Algorithm for the Steiner Forest Problem
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Distance transformation for network design problems
- Optimization in telecommunication networks
- A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- Approximation algorithms for Steiner forest: An experimental study
- Telecommunications network design: Technology impacts and future directions
- Spatial optimization of multiple area land acquisition
- Vertex covering with capacitated trees
- A classification method based on a cloud of spheres
- A computational study on integer programming formulations for hop-constrained survivable network design
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
- Partition inequalities for capacitated survivable network design based on directed p-cycles
- A mixed integer programming model for multiple stage adaptive testing
This page was built for publication: Strong formulations for network design problems with connectivity requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667715)
