IDEAS home Printed from https://ideas.repec.org/p/por/fepwps/475.html
   My bibliography  Save this paper

Solving Concave Network Flow Problems

Author

Listed:
  • Marta S.R. Monteiro

    (Faculdade de Economia da Universidade do Porto)

  • Dalila B.M.M. Fontes

    (Faculdade de Economia da Universidade do Porto)

  • Fernando A.C.C. Fontes

    (Faculdade de Engenharia da Universidade do Porto)

Abstract

The Minimum Cost Network Flow Problem (MCNFP) includes a wide range of combinatorial optimization problems. Many applications exist for MCNFPs for instance supply chains, logistics, production planning, communications and transportations. Concave costs are, in many applications, more realistic than linear ones because of the association of prices with economies of scale. When concave costs are introduced in MCNFPs, then the difficulty to solve them increases and they become NP-Hard. Solution methods developed for these problems comprise both exact and approximate algorithms, the latter ones usually of a heuristic type. What we propose to do in this work is to present an overview of the past and most recent literature published on the subject.

Suggested Citation

  • Marta S.R. Monteiro & Dalila B.M.M. Fontes & Fernando A.C.C. Fontes, 2012. "Solving Concave Network Flow Problems," FEP Working Papers 475, Universidade do Porto, Faculdade de Economia do Porto.
    • Handle: RePEc:por:fepwps:475
    as

    Download full text from publisher

    File URL: http://www.fep.up.pt/investigacao/workingpapers/wp475.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Minimum Cost Network Flow Problems; Survey; Heuristics; Exact Methods;
    All these keywords.

    JEL classification:

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

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:por:fepwps:475. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/fepuppt.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.