New formulations and solution procedures for the hop constrained network design problem.
type: Item
instance of: scholarly article
title: New formulations and solution procedures for the hop constrained network design problem.
zbMATH Open document ID: 1036.90501
DOI: 10.1016/S0377-2217(02)00366-1
author: Hasan Pirkul
author: Samit Soni
published in: European Journal of Operational Research
publication date: 2003-06-09T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1924652
zbMATH Keywords: telecommunications
zbMATH Keywords: linear programming
zbMATH Keywords: heuristics
MaRDI profile type: Publication
cites work: Primary and secondary route selection in backbone communication networks
cites work: Using a Hop-Constrained Model to Generate Alternative Communication Network Design
cites work: Heuristics, LPs, and Trees on Trees: Network Design Analyses
cites work: Designing hierarchical survivable networks
cites work: Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
cites work: Routing in computer networks
cites work: Iterative improvement methods for a multiperiod network design problem
cites work: Backbone Network Design Tools with Economic Tradeoffs
cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
cites work: Q4130999
cites work: Packet Routing in Telecommunication Networks with Path and Flow Restrictions
cites work: Discrete Link Capacity and Priority Assignments in Communication Networks
cites work: Q4040221
cites work: Routing in packet-switched communication networks with different criticality classes of communicating node pairs
cites work: Primary and Secondary Route Selection in Backbone Computer Networks
cites work: An efficient procedure for designing single allocation hub and spoke systems
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
description: scientific article; zbMATH DE number 1924652