Pages that link to "Item:Q1810496"

The following pages link to New formulations and solution procedures for the hop constrained network design problem. (Q1810496):

Displaying 9 items.

• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• Optimal placement of UV-based communications relay nodes (Q604957) (← links)
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
• Hub location for time definite transportation (Q833526) (← links)
• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
• Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
• Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012) (← links)
• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
• Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees (Q2235240) (← links)