New formulations and solution procedures for the hop constrained network design problem.
From MaRDI portal
Publication:1810496
DOI10.1016/S0377-2217(02)00366-1zbMath1036.90501MaRDI QIDQ1810496
Publication date: 9 June 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C05: Linear programming
90C59: Approximation methods and heuristics in mathematical programming
90B05: Inventory, storage, reservoirs
Related Items
New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints, Optimal placement of UV-based communications relay nodes, New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints, Hub location for time definite transportation, A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, Extended formulation for hop constrained distribution network configuration problems, Lagrangean relaxation heuristics for the \(p\)-cable-trench problem, Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks, Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
Cites Work
- Unnamed Item
- Unnamed Item
- Primary and secondary route selection in backbone communication networks
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Iterative improvement methods for a multiperiod network design problem
- Designing Hierarchical Survivable Networks
- An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Backbone Network Design Tools with Economic Tradeoffs
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Discrete Link Capacity and Priority Assignments in Communication Networks
- Primary and Secondary Route Selection in Backbone Computer Networks
- Routing in packet-switched communication networks with different criticality classes of communicating node pairs
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Packet Routing in Telecommunication Networks with Path and Flow Restrictions
- Routing in computer networks
- Heuristics, LPs, and Trees on Trees: Network Design Analyses
