Skip to main content

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks

  • Conference paper
Operations Research Proceedings 2006

Part of the book series: Operations Research Proceedings ((ORP,volume 2006))

Abstract

We consider a generalization of the Steiner tree problem on graphs suitable for the design of the last mile in fiber optic networks and propose a multi commodity flow formulation for the exact solution of this problem. Some experimental results are discussed.

This work is supported by the Austrian Research Promotion Agency (FFG) under grant 811378 and the European Marie Curie RTN ADONET under grant 504438.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms, and applications. Prentice-Hall, 1993.

    Google Scholar 

  2. P. Bachhiesl. The OPT-and the SST-problems for real world access network design — basic definitions and test instances. Working Report Nr. 01/2005, Department of Telematics and Network Engineering, Carinthia Tech Institute, Austria, 2005.

    Google Scholar 

  3. H. A. Eiselt and C.-L. Sandblom. Integer Programming and Network Models. Springer, 2000.

    Google Scholar 

  4. M. X. Goemans and D. P. Williamson. The Primal-Dual Method for Approximation Algorithms and its Application to Network Design Problems, chapter 4, pages 144–191. PWS Publishing, 1997.

    Google Scholar 

  5. I. Ljubić, R. Weiskircher, U. Pferschy, G. W. Klau, P. Mutzel, and M. Fischetti. An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming, 105(2–3):427–449, February 2006.

    Article  Google Scholar 

  6. M. Pióro and D. Medhi. Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, 2004.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wagner, D., Raidl, G.R., Pferschy, U., Mutzel, P., Bachhiesl, P. (2007). A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_33

Download citation

Publish with us

Policies and ethics