Pages that link to "Item:Q1810496"
From MaRDI portal
The following pages link to New formulations and solution procedures for the hop constrained network design problem. (Q1810496):
Displaying 16 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)
- Design of a distributed finer transport network with hubbing topology (Q1291680) (← links)
- Hybrid fiber co-axial CATV network design with variable capacity optical network units (Q1577122) (← 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)
- On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints (Q3156822) (← links)
- Hybrid Fiber Coaxial Network Design (Q3635114) (← links)
- Design of Performance Constrained Optic Fiber Multidrop Access Networks (Q4291500) (← links)
- Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (Q4642425) (← links)
- Tree embeddings for hop-constrained network design (Q6087007) (← links)
