Pages that link to "Item:Q4030790"
From MaRDI portal
The following pages link to Using a Hop-Constrained Model to Generate Alternative Communication Network Design (Q4030790):
Displaying 30 items.
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← 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)
- A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
- Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728) (← links)
- Exploring the constrained maximum edge-weight connected graph problem (Q1048254) (← links)
- Topological design of wide area communication networks (Q1197802) (← links)
- Multicommodity flow models for spanning trees with hop constraints (Q1278374) (← links)
- Designing reliable tree networks with two cable technologies (Q1291775) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- On the directed hop-constrained shortest path problem (Q1433652) (← links)
- Hybrid fiber co-axial CATV network design with variable capacity optical network units (Q1577122) (← links)
- Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
- Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
- Container shipping service selection and cargo routing with transshipment limits (Q1694945) (← links)
- New formulations and solution procedures for the hop constrained network design problem. (Q1810496) (← links)
- Asynchronous transfer mode networks with parallel links and multiple service classes (Q1869520) (← links)
- Cost-optimal topology planning of hierarchical access networks (Q1886727) (← links)
- Graceful reassignment of excessively long communications paths in networks (Q1887906) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (Q3418127) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems (Q5058001) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- Design of Survivable Networks: A survey (Q5318274) (← links)
