Pages that link to "Item:Q1035728"

The following pages link to Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728):

Displaying 16 items.

• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
• The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
• Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra (Q486728) (← links)
• A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
• Risk approaches for delivering disaster relief supplies (Q647529) (← links)
• Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• The \(q\)-ad hoc hub location problem for multi-modal networks (Q1642959) (← links)
• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
• Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
• Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models (Q3087850) (← links)
• A formulation for a hop constrained survivable network design problem (Q4987706) (← links)
• A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
• Further contributions to network optimization (Q5487817) (← links)
• (Q6087208) (← links)