Using a Hop-Constrained Model to Generate Alternative Communication Network Design
From MaRDI portal
Cited in
(34)- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
- Design of Survivable Networks: A survey
- Asynchronous transfer mode networks with parallel links and multiple service classes
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
- On Hop-Constrained Steiner Trees in Tree-Like Metrics
- Graceful reassignment of excessively long communications paths in networks
- Container shipping service selection and cargo routing with transshipment limits
- Extended formulation for hop constrained distribution network configuration problems
- Algorithms for a multi-level network optimization problem
- Network design with vulnerability constraints and probabilistic edge reliability
- Designing reliable tree networks with two cable technologies
- Cost-optimal topology planning of hierarchical access networks
- Hybrid fiber co-axial CATV network design with variable capacity optical network units
- Optimal placement of UV-based communications relay nodes
- A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
- Branch-and-cut methods for the network design problem with vulnerability constraints
- New formulations and solution procedures for the hop constrained network design problem.
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- Optimal network design with end-to-end service requirements
- Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing
- On the chance-constrained minimum spanning \(k\)-core problem
- Exploring the constrained maximum edge-weight connected graph problem
- Hop-constrained node survivable network design: An application to MPLS over WDM
- A computational study on integer programming formulations for hop-constrained survivable network design
- Multicommodity flow models for spanning trees with hop constraints
- Topological design of wide area communication networks
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
- On the directed hop-constrained shortest path problem
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
- A polyhedral study of the diameter constrained minimum spanning tree problem
- A complete characterization of jump inequalities for the hop-constrained shortest path problem
This page was built for publication: Using a Hop-Constrained Model to Generate Alternative Communication Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030790)
