Optimization in telecommunication networks

DOI10.1111/j.1467-9574.2005.00286.xzbMath1096.90004OpenAlexW2148871846MaRDI QIDQ5313481

Stan P. M. van Hoesel

Publication date: 1 September 2005

Published in: Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/8ae2ca02-6d40-4deb-bea0-0f286271b5ba

zbMATH Keywords

network designroutingmulti-commodity flowwavelength assignmentoptical networkgrooming

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Related Items (1)

Analysis of bandwidth allocation on end-to-end QoS networks under budget control

Cites Work

• Unnamed Item
• The convex hull of two core capacitated network design problems
• Wavelength conversion in all-optical networks with shortest-path routing
• Edge-disjoint paths in planar graphs
• Two-edge connected spanning subgraphs and polyhedra
• SONET/SDH ring assignment with capacity constraints
• A tabu search algorithm for self-healing ring network design.
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• On capacitated network design cut-set polyhedra
• Fast approximation algorithms for multicommodity flow problems
• Exact solution of the SONET ring loading problem
• A polyhedral approach to an integer multicommodity flow problem
• Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
• Wavelength Conversion in Optical Networks
• Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting
• Optimum Communication Spanning Trees
• Maximal Flow Through a Network
• Wavelength Routing and Assignment in a Survivable WDM Mesh Network
• Multi-Terminal Network Flows
• On the Complexity of Timetable and Multicommodity Flow Problems
• The Ring Loading Problem
• Exact algorithms for minimum routing cost trees
• The ring grooming problem
• Strong formulations for network design problems with connectivity requirements
• Approximation algorithms for constructing wavelength routing networks
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• Synthesis of a Communication Network
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• Sparse and limited wavelength conversion in all-optical tree networks

This page was built for publication: Optimization in telecommunication networks