Skip to main content
SpringerLink
Log in

Advanced start for the multicommodity network flow problem

  • Short Papers
  • Chapter
  • First Online:
Netflow at Pisa

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 26))

Abstract

Advanced starting bases to solve the minimal cost multicommodity network flow problem are proposed. The underlying idea is to use subgradient techniques on the Lagrangean relaxation relative to the coupling constraints. Optimal single commodity solutions are thus found, almost satisfying the coupling constraints. Some computational aspects and preliminary encouraging results are presented and discussed.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.D. Grigoriadis and W.W. White, “A partitioning algorithm for the multicommodity network flow problem”, Mathematical Programming 3 (1972) 157–177.

    Article  MATH  MathSciNet  Google Scholar 

  2. W.S. Jewell, “A primal-dual multi-commodity flow algorithm”, ORC 66-24, Operations Research Center, University of California (Berkeley, CA, 1966).

    Google Scholar 

  3. J.L. Kennington, “Solving multicommodity transportation problems using a primal partitioning simplex technique”, Naval Research Logistics Quarterly 24 (1977) 309–325.

    Article  MATH  MathSciNet  Google Scholar 

  4. J.L. Kennington and M. Shalaby, “An effective subgradient procedure for minimal cost multicommodity flow problems”, Management Science 23 (1977) 994–1004.

    Article  MATH  Google Scholar 

  5. D. Klingman, A. Napier and J. Stutz, “NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems”, Management Science 20 (1974) 814–821.

    Article  MATH  MathSciNet  Google Scholar 

  6. R.T. Robacker, “Notes on linear programming: Part XXXVII, Concerning Multicommodity Networks”, Memo RM-1799, The RAND Corporation (Santa Monica, CA, 1956).

    Google Scholar 

  7. J.A. Tomlin, “Mathematical programming models for traffic network problems”, unpublished dissertation, Department of Mathematics, University of Adelaide (Adelaide, Australia, 1967).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM-Italy Scientific Center, Via S. Maria 67, 56100, Pisa, Italy

    G. Saviozzi

Authors
  1. G. Saviozzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Gallo Claudio Sandi

Rights and permissions

Reprints and permissions

Copyright information

© 1986 The Mathematical Programming Society, Inc.

About this chapter

Cite this chapter

Saviozzi, G. (1986). Advanced start for the multicommodity network flow problem. In: Gallo, G., Sandi, C. (eds) Netflow at Pisa. Mathematical Programming Studies, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121100

Download citation

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

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00922-8

  • Online ISBN: 978-3-642-00923-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation