A column generation algorithm for bandwidth packing

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1993 English Publisher:Springer Science and Business Media LLCJournal:Telecommunication Systems, volume 2, pages 185-195 (issn: 1018-4864, eissn: 1572-9451,

Copyright policy )

Authors: Mark Parker; Jennifer Ryan;

doi: 10.1007/bf02109857

A column generation algorithm for bandwidth packing

- Summary
- Metrics

Abstract

We describe a column generation branch and bound procedure for optimally solving the bandwidth packing problem. The objective of this problem is to allocate bandwidth in a telecommunications network to maximize total revenue. The problem is formulated as an integer programming problem and the linear programming relaxation solved using column generation and the simplex algorithm. A branch and bound procedure which branches upon a particular path being used for a bandwidth routing is used to solve the IP. We present computational results.

Related Organizations

University of Colorado Denver
United States

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	39
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average