Pages that link to "Item:Q3418127"

The following pages link to The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (Q3418127):

Displaying 31 items.

• Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
• On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
• The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
• The convex hull of two core capacitated network design problems (Q689128) (← links)
• Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
• Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728) (← links)
• Two-connected networks with rings of bounded cardinality (Q1424779) (← links)
• The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
• Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
• Polyhedral results for two-connected networks with bounded rings (Q1849257) (← links)
• An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes (Q1994496) (← links)
• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
• Trade-offs among degree, diameter, and number of paths (Q2112655) (← links)
• Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
• On the number of edges in a graph with many two-hop disjoint paths (Q2192123) (← links)
• A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
• The two-level diameter constrained spanning tree problem (Q2340278) (← links)
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
• The Two Level Network Design Problem with Secondary Hop Constraints (Q3091484) (← links)
• On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints (Q3156822) (← links)
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
• Integer programming formulations for the two 4-hop-constrained paths problem (Q3428909) (← links)
• Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (Q4642425) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
• A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
• Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786) (← links)
• Further contributions to network optimization (Q5487817) (← links)
• A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1} (Q5500393) (← links)
• (Q6087208) (← links)
• A computational study on integer programming formulations for hop-constrained survivable network design (Q6657263) (← links)
• Design of survivable networks with low connectivity requirements (Q6659118) (← links)