Using a Hop-Constrained Model to Generate Alternative Communication Network Design

DOI10.1287/ijoc.4.2.192zbMath0825.90395OpenAlexW4234408051MaRDI QIDQ4030790

Anantaram Balakrishnan, Kemal Altinkemer

Publication date: 1 April 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.4.2.192

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (31)

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

This page was built for publication: Using a Hop-Constrained Model to Generate Alternative Communication Network Design