Skip to main content
SpringerLink
Log in

A column generation algorithm for bandwidth packing

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Anderson, K. Jones, M. Parker and J. Ryan, Path assignment for call routing: An application of tabu search, Ann. Oper. Res. 41(1993)301–312.

    Article  Google Scholar 

  2. C. Barnhart, E. Johnson and G. Sigismondi, An alternative formulation and solution strategy for multi-commodity network flow problems, Preprint.

  3. V. Chvátal,Linear Programming (Freeman, New York, 1983).

    Google Scholar 

  4. L.A. Cox, L. Davis and Y. Qiu, Dynamic anticipatory routing in circuit-switched telecommunications networks, in:Handbook of Genetic Algorithms, ed. L. Davis (Van Nostrand Reinhold, New York, 1991).

    Google Scholar 

  5. J. Desrosiers, F. Soumis and M. Desrochers, Routing with time windows by column generation, Networks 14(1984)545–565.

    Google Scholar 

  6. M. Laguna and F. Glover, Bandwidth packing: A tabu search approach, Manag. Sci. 39(1993)492–500.

    Google Scholar 

  7. G. Nemhauser and L. Wolsey,Integer Programming and Combinatorial Optimization (Wiley, New York, 1988).

    Google Scholar 

  8. M. Padberg and G. Rinaldi, A branch and cut algorithm for the resolution of large scale symmetric traveling salesman problems, SIAM Rev. 33(1)(1991)60–100.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Colorado at Denver, P.O. Box 173364, 80217, Denver, CO, USA

    Mark Parker & Jennifer Ryan

Authors
  1. Mark Parker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jennifer Ryan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was partially supported by a grant from the Colorado Advanced Software Institute and by Air Force Office of Scientific Research and Office of Naval Research Contract Nos. F49620-90-C-0033 and F49620-92-J-0248-DEF.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Parker, M., Ryan, J. A column generation algorithm for bandwidth packing. Telecommunication Systems 2, 185–195 (1993). https://doi.org/10.1007/BF02109857

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02109857

Keywords

Search

Navigation