Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
type: Item
instance of: scholarly article
title: Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
zbMATH Open document ID: 1053.90022
DOI: 10.1016/S0377-2217(02)00804-4
author: J. Cole Smith
published in: European Journal of Operational Research
publication date: 2004-02-02T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 2035777
zbMATH Keywords: Network flows
zbMATH Keywords: Telecommunications
zbMATH Keywords: Integer programming
zbMATH Keywords: Synchronous optical network
MaRDI profile type: Publication
cites work: Improved Algorithms for Bipartite Network Flow
cites work: Computational investigations of maximum flow algorithms
cites work: Q3056948
cites work: Facets of the knapsack polytope
cites work: Optimal placement of add/drop multiplexers: Static and dynamic models
cites work: Exact solution of the SONET ring loading problem
cites work: Q4198056
cites work: Recent developments in maximum flow algorithms
cites work: A new approach to the maximum-flow problem
cites work: The SONET edge‐partition problem
cites work: SONET/SDH ring assignment with capacity constraints
cites work: Sonet ring sizing with genetic algorithms
cites work: Clustering for the Design of SONET Rings in Interoffice Telecommunications
cites work: A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
cites work: Optimal Load Balancing on Sonet Bidirectional Rings
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
cites work: Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
cites work: Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
description: scientific article; zbMATH DE number 2035777