Strong formulations for network design problems with connectivity requirements
From MaRDI portal
Publication:4667715
DOI10.1002/net.20046zbMath1067.68104OpenAlexW4247103873MaRDI QIDQ4667715
No author found.
Publication date: 21 April 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20046
projectionvalid inequalitiessurvivabilitystrong formulationsSteiner forest problemdirected formulations
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (33)
Heuristics for the network design problem with connectivity requirements ⋮ Network Design with Service Requirements: Scaling-up the Size of Solvable Problems ⋮ Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice ⋮ Hierarchical survivable network design problems ⋮ An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment ⋮ Power optimization in ad hoc wireless network topology control with biconnectivity requirements ⋮ A branch-and-cut algorithm for two-level survivable network design problems ⋮ Optimization in telecommunication networks ⋮ 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 ⋮ Topology design for on-demand dual-path routing in wireless networks ⋮ Survivability in Hierarchical Telecommunications Networks Under Dual Homing ⋮ Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design ⋮ Stronger MIP formulations for the Steiner forest problem ⋮ A hybrid optimization approach for the Steiner \(k\)-connected network design problem ⋮ Formulations for designing robust networks. An application to wind power collection ⋮ An Exact Algorithm for the Steiner Forest Problem ⋮ Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles ⋮ Solving the optimum communication spanning tree problem ⋮ Stochastic survivable network design problems: theory and practice ⋮ A mixed integer programming model for multiple stage adaptive testing ⋮ On the chance-constrained minimum spanning \(k\)-core problem ⋮ Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints ⋮ 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 ⋮ On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem ⋮ Branch-and-cut approaches for chance-constrained formulations of reliable network design problems ⋮ Distance Transformation for Network Design Problems ⋮ Hop-constrained node survivable network design: An application to MPLS over WDM ⋮ Strong Formulations for 2-Node-Connected Steiner Network Problems
Cites Work
This page was built for publication: Strong formulations for network design problems with connectivity requirements
