Skip to main content
SpringerLink
Log in

Extreme points and adjacency relationship in the flow polytope

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

Extreme flows, that is extreme points of the feasible set for network flow problems, play a fundamental role in most optimization problems. The adiacency relation between extreme flows is investigated, and a theorem is stated, which, for any extreme flow on a given network, defines a one-to-one correspondence between the set of its neighboring extreme flows and a set of cycles.

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. G. B. Dantzig,Linear Programming and Extensions (1963), Princeton University Press, Princeton, New Jersey.

    MATH  Google Scholar 

  2. M. Florian, M. Rossin Arthiat, D. De Werra,A property of Minimum Concave Cost Flows in Capacitated Networks, Canad. J. Operations Res.9 (1971), 293–304.

    Google Scholar 

  3. J. K. Hartman, L. S. Lasdon,A Generalized Upper Bounding Algorithm for Multicommodity Network flow Problems, Networks1 (1972), 333–354.

    MATH  MathSciNet  Google Scholar 

  4. E. L. Johnson,Networks and Basic Solutions, Operations Res14 (1966), 619–623.

    Google Scholar 

  5. S. F. Maier,A Compact Inverse Scheme Applied to a Multicommodity Network with Resource Constraints. Optimization Methods (174), R. W. Cottle & J. Krarup ed., The English University Press.

  6. B. Roy Algebre Moderne et Theorie des Graphes, tome 2 (1970), Dunod, Paris.

    MATH  Google Scholar 

  7. W. I. Zangwill,Minimum Concave Cost Flows in Certain Networks, Management Sci.14 (1968), 429–450

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Elaborazione dell’Informazione, Pisa

    G. Gallo

  2. I.S.I., Università di Pisa, Pisa

    C. Sodini

Authors
  1. G. Gallo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Sodini
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gallo, G., Sodini, C. Extreme points and adjacency relationship in the flow polytope. Calcolo 15, 277–288 (1978). https://doi.org/10.1007/BF02575918

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation