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

A Lagrangean heuristic for the capacitated concave minimum cost network flow problem

Author

Listed:
  • Larsson, Torbjorn
  • Migdalas, Athanasios
  • Ronnqvist, Mikael

Abstract

No abstract is available for this item.

Suggested Citation

  • Larsson, Torbjorn & Migdalas, Athanasios & Ronnqvist, Mikael, 1994. "A Lagrangean heuristic for the capacitated concave minimum cost network flow problem," European Journal of Operational Research, Elsevier, vol. 78(1), pages 116-129, October.
    • Handle: RePEc:eee:ejores:v:78:y:1994:i:1:p:116-129
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)90126-0
    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. Vasilios I. Manousiouthakis & Neil Thomas & Ahmad M. Justanieah, 2011. "On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope," Journal of Optimization Theory and Applications, Springer, vol. 151(1), pages 121-134, October.
    2. Xing, Tao & Zhou, Xuesong, 2011. "Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1660-1679.
    3. Yixin Zhao & Torbjörn Larsson & Elina Rönnberg & Panos M. Pardalos, 2018. "The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation," Journal of Global Optimization, Springer, vol. 72(3), pages 517-538, November.
    4. 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.
    5. Wu, Xin & Nie, Lei & Xu, Meng & Zhao, Lili, 2019. "Distribution planning problem for a high-speed rail catering service considering time-varying demands and pedestrian congestion: A lot-sizing-based model and decomposition algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 61-89.
    6. 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.
    7. 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.
    8. 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.
    9. Cortés, Pablo & Muñuzuri, Jesús & Guadix, José & Onieva, Luis, 2013. "Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs," International Journal of Production Economics, Elsevier, vol. 146(1), pages 313-324.

    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:78:y:1994:i:1:p:116-129. 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.