IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v4y1980i4p248-255.html
   My bibliography  Save this article

An algorithm for the min concave cost flow problem

Author

Listed:
  • Gallo, Giorgio
  • Sandi, Claudio
  • Sodini, Claudio

Abstract

No abstract is available for this item.

Suggested Citation

  • Gallo, Giorgio & Sandi, Claudio & Sodini, Claudio, 1980. "An algorithm for the min concave cost flow problem," European Journal of Operational Research, Elsevier, vol. 4(4), pages 248-255, April.
  • Handle: RePEc:eee:ejores:v:4:y:1980:i:4:p:248-255
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(80)90109-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
    3. Fontes, Dalila B.M.M. & Hadjiconstantinou, Eleni & Christofides, Nicos, 2006. "A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1205-1219, October.
    4. Vincenzo Bonifaci & Tobias Harks & Guido Schäfer, 2010. "Stackelberg Routing in Arbitrary Networks," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 330-346, May.
    5. F Altiparmak & I Karaoglan, 2008. "An adaptive tabu-simulated annealing for concave cost transportation problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 331-341, March.
    6. Kurt M. Bretthauer, 1994. "A penalty for concave minimization derived from the tuy cutting plane," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(3), pages 455-463, April.
    7. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems (revised as on 12/08/2021)," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    8. Tomohiko Mizutani & Makoto Yamashita, 2013. "Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables," Journal of Global Optimization, Springer, vol. 56(3), pages 1073-1100, July.
    9. Shangyao Yan & Yu-Lin Shih & Wang-Tsang Lee, 2011. "A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems," Journal of Global Optimization, Springer, vol. 49(4), pages 539-559, April.
    10. Yan, Shangyao & Luo, So-Chang, 1999. "Probabilistic local search algorithms for concave cost transportation network problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 511-521, September.
    11. Lai, Minghui & Cai, Xiaoqiang & Li, Xiang, 2017. "Mechanism design for collaborative production-distribution planning with shipment consolidation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 137-159.

    More about this item

    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:eee:ejores:v:4:y:1980:i:4:p:248-255. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.