Pages that link to "Item:Q4667715"

The following pages link to Strong formulations for network design problems with connectivity requirements (Q4667715):

Displaying 34 items.

• Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
• Hierarchical survivable network design problems (Q325448) (← links)
• Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
• A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
• Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
• Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
• A mixed integer programming model for multiple stage adaptive testing (Q958075) (← links)
• Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728) (← links)
• A hybrid optimization approach for the Steiner \(k\)-connected network design problem (Q1742248) (← links)
• Formulations for designing robust networks. An application to wind power collection (Q1742258) (← links)
• Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
• Topology design for on-demand dual-path routing in wireless networks (Q1947619) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
• On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
• An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment (Q2642500) (← links)
• Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
• Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
• An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← links)
• Network Design with Service Requirements: Scaling-up the Size of Solvable Problems (Q5058001) (← links)
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
• Distance Transformation for Network Design Problems (Q5231681) (← links)
• Optimization in telecommunication networks (Q5313481) (← links)
• Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
• Approximation algorithms for Steiner forest: An experimental study (Q6065858) (← links)
• Telecommunications network design: Technology impacts and future directions (Q6087074) (← links)
• Spatial optimization of multiple area land acquisition (Q6164366) (← links)
• Vertex covering with capacitated trees (Q6179715) (← links)
• A classification method based on a cloud of spheres (Q6491344) (← links)