Calculating cost coefficients for generation of rings in network design
2003 (English)Report (Other academic)
We discuss a telecommunication network problem where the aim is to design a network that should be composed of connected rings of links. Each possible ring is associated with a certain fixed cost. The traffic between rings may pass through other rings, where the switch between two rings must be done at certain transit nodes. Each ring must pass at least one transit node. We describe the problem, modeled as a linear integer programming problem. We focus on calculating cost coefficients for ring generation using Lagrangean relaxation.
Place, publisher, year, edition, pages
Linköping: Linköpings universitet , 2003. , 27 p.
LiTH-MAT-R, ISSN 0348-2960 ; 18
network design, rings, integer programming, column generation, lagrangean relaxation
IdentifiersURN: urn:nbn:se:liu:diva-22368Local ID: 1576OAI: oai:DiVA.org:liu-22368DiVA: diva2:242681