IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/39759.html
   My bibliography  Save this paper

Algoritmi di flusso massimo al minimo costo
[Maximum flow - minimum cost algorithms]

Author

Listed:
  • Parrini, Alessandro

Abstract

This work concerns the maximum flows – minimum cost problem and its main algorithmic solutions. Such a problem involves determining the least cost shipment of a commodity through a capacitated network in order to satisfy demands at certain vertices using supplies available at other vertices. It generalizes both the shortest path problem and the maximum flow problem. The search for this particular flow can be obtained by interfacing the "maximum flow algorithm" (by Ford & Fulkerson) with a "shortest path algorithm" (we choose the one by Dijkstra): this will lead to two new algorithms: the "cycle-canceling algorithm" and "successive shortest path algorithm".

Suggested Citation

  • Parrini, Alessandro, 2009. "Algoritmi di flusso massimo al minimo costo [Maximum flow - minimum cost algorithms]," MPRA Paper 39759, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:39759
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/39759/1/MPRA_paper_39759.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    maximum flow algorithm; shortest path problem; cycle-canceling algorithm; successive shortest path algorithm;
    All these keywords.

    JEL classification:

    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
    • C0 - Mathematical and Quantitative Methods - - General
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:39759. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.