Optimization in telecommunication networks

DOI10.1111/J.1467-9574.2005.00286.XzbMATH Open1096.90004OpenAlexW2148871846MaRDI QIDQ5313481FDOQ5313481

Authors: Stan 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

Recommendations

• Optimization of communication networks
• Optimization in designing complex communication networks
• Optimality with telecommunications network
• Optimization for communications and networks.
• scientific article; zbMATH DE number 2050768
• Stochastic optimization in telecommunications
• Optimization of Network Topologies for Service Providers in the Telecommunications Market
• Optimization in wireless networks
• Combinatorial optimization in communication networks.
• scientific article; zbMATH DE number 5070513

zbMATH Keywords

network designroutingmulti-commodity flowwavelength assignmentoptical networkgrooming

Mathematics Subject Classification ID

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

Cites Work

• Maximal Flow Through a Network
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• The convex hull of two core capacitated network design problems
• On the Complexity of Timetable and Multicommodity Flow Problems
• Strong formulations for network design problems with connectivity requirements
• On capacitated network design cut-set polyhedra
• Synthesis of a Communication Network
• Wavelength conversion in optical networks
• Multi-Terminal Network Flows
• A tabu search algorithm for self-healing ring network design.
• Optimum Communication Spanning Trees
• Wavelength Routing and Assignment in a Survivable WDM Mesh Network
• Exact algorithms for minimum routing cost trees
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• SONET/SDH ring assignment with capacity constraints
• Edge-disjoint paths in planar graphs
• Two-edge connected spanning subgraphs and polyhedra
• A polyhedral approach to an integer multicommodity flow problem
• The ring grooming problem
• The Ring Loading Problem
• Approximating fractional multicommodity flow independent of the number of commodities
• Fast approximation algorithms for multicommodity flow problems
• Title not available (Why is that?)
• Sparse and limited wavelength conversion in all-optical tree networks
• Wavelength conversion in all-optical networks with shortest-path routing
• Exact solution of the SONET ring loading problem
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• Approximation algorithms for constructing wavelength routing networks
• Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Tariff optimization in networks
• The telecommunication network optimal topology designing
• Graphs and algorithms in communication networks on seven league boots
• Telecommunication network grooming
• Analysis of bandwidth allocation on end-to-end QoS networks under budget control
• Bounds for global optimization of capacity expansion and flow assignment problems

This page was built for publication: Optimization in telecommunication networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313481)