Skip to main content
SpringerLink
Log in

Optimal expansion of an existing network

  • Published:
Mathematical Programming Submit manuscript

Abstract

Given an existing network, a list of arcs which could be added to the network, the arc costs and capacities, and an available budget, the problem considered in this paper is one of choosing which arcs to add to the network in order to maximize the maximum flow from a sources to a sinkt, subject to the budgetary constraint. This problem appears in a large number of practical situations which arise in connection with the expansion of electricity or gas supply, telephone, road or rail networks.

The paper describes an efficient tree-search algorithm using bounds calculated by a dynamic programming procedure which are very effective in limiting the solution space explicitly searched. Computational results for a number of medium sized problems are described and computing times are seen to be very reasonable.

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. I.R. Ford and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962).

    Google Scholar 

  2. D.R. Fulkerson, “Increasing the capacity of a network: The parametric budget problem”,Management Science 5 (1959) 472–483.

    Google Scholar 

  3. L.L. Garver, “Transmission network estimation using linear programming”,Transactions of the Institute of Electrical and Electronic Engineers 89 (1972) 1688–1697.

    Google Scholar 

  4. A. Geoffrion, “Integer programming by implicit enumeration and Balas' method”,SIAM Review 9 (1966) 178–189.

    Google Scholar 

  5. T.C. Hu,Integer programming and network flows (Addison-Wesley, Reading, Mass., 1970).

    Google Scholar 

  6. J.C. Kaltenbach, J. Peschon and E.H. Gehrig, “A mathematical optimization technique for the expansion of electric power transmission systems”,Transactions of the Institute of Electrical and Electronic Engineers 89 (1972) 113–119.

    Google Scholar 

  7. J.D.C. Little, K.G. Murty, D.W. Sweeney and C. Karel, “An algorithm for the travelling salesman problem”,Operations Research 11 (1963) 979–989.

    Google Scholar 

  8. R.D. Wollmer, “Some methods for determining the most vital link in a railway network”, The RAND Corporation Rept. RM-3321-ISA (1963).

  9. R.D. Wollmer, “Algorithms for targeting strikes in a lines-of-communication (LOC) network”, The RAND Corporation Rept. RM-5864-PR (1969).

Download references

Author information

Authors and Affiliations

  1. Imperial College of Science and Technology, London, Great Britain

    Nicos Christofides & P. Brooker

Authors
  1. Nicos Christofides
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Brooker
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by a grant from the Science Research Council, Great Britain.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Christofides, N., Brooker, P. Optimal expansion of an existing network. Mathematical Programming 6, 197–211 (1974). https://doi.org/10.1007/BF01580236

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation