IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v11y2006i4d10.1007_s10878-006-8211-9.html
   My bibliography  Save this article

Some further results on minimum distribution cost flow problems

Author

Listed:
  • Haiyan Lu

    (Zhejiang University
    Southern Yangtze University)

  • Enyu Yao

    (Zhejiang University)

  • Liqun Qi

    (Hong Kong Polytechnic University)

Abstract

Manufacturing network flow (MNF) is a generalized network model that can model more complicated manufacturing scenarios, such as the synthesis of different materials to one product and/or the distilling of one material to many different products. Minimum distribution cost flow problem (MDCF) is a simplified version of MNF optimization problems, in which a general supplier wants to proportionally distribute certain amount of a particular product from a source node to several retailers at different destinations through a distribution network. A network simplex algorithm has been outlined in recent years for solving a special case of MDCF. In this paper, we characterize the network structure of the bases of the MDCF problem and develop a primal simplex algorithm that exploits the network structure of the problem. These results are extensions of those of the ordinary network flow problems. In conclusion, some related interesting problems are proposed for future research.

Suggested Citation

  • Haiyan Lu & Enyu Yao & Liqun Qi, 2006. "Some further results on minimum distribution cost flow problems," Journal of Combinatorial Optimization, Springer, vol. 11(4), pages 351-371, June.
  • Handle: RePEc:spr:jcomop:v:11:y:2006:i:4:d:10.1007_s10878-006-8211-9
    DOI: 10.1007/s10878-006-8211-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-8211-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-006-8211-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Calvete, Herminia I., 2003. "Network simplex algorithm for the general equal flow problem," European Journal of Operational Research, Elsevier, vol. 150(3), pages 585-600, November.
    2. Ravindra K. Ahuja & James B. Orlin & Giovanni M. Sechi & Paola Zuddas, 1999. "Algorithms for the Simple Equal Flow Problem," Management Science, INFORMS, vol. 45(10), pages 1440-1455, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Gengjun Gao & Yuxuan Che & Jian Shen, 0. "Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-18.
    2. Prahalad Venkateshan & Kamlesh Mathur & Ronald H. Ballou, 2008. "An efficient generalized network-simplex-based algorithm for manufacturing network flows," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 315-341, May.
    3. Michael Holzhauser & Sven O. Krumke & Clemens Thielen, 2017. "Maximum flows in generalized processing networks," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1226-1256, May.
    4. Mohammad Ali Raayatpanah & Salman Khodayifar & Thomas Weise & Panos Pardalos, 2022. "A novel approach to subgraph selection with multiple weights on arcs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 242-268, August.
    5. Gengjun Gao & Yuxuan Che & Jian Shen, 2021. "Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 866-883, November.
    6. ÇalIskan, Cenk, 2011. "A specialized network simplex algorithm for the constrained maximum flow problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 137-147, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. David R. Morrison & Jason J. Sauppe & Sheldon H. Jacobson, 2013. "A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 2-12, February.
    2. Kaul, Hemanshu & Rumpf, Adam, 2022. "A linear input dependence model for interdependent networks," European Journal of Operational Research, Elsevier, vol. 302(2), pages 781-797.
    3. Jordi Castro, 2007. "A Shortest-Paths Heuristic for Statistical Data Protection in Positive Tables," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 520-533, November.
    4. Christina Büsing & Arie M. C. A. Koster & Sabrina Schmitz, 2022. "Robust minimum cost flow problem under consistent flow constraints," Annals of Operations Research, Springer, vol. 312(2), pages 691-722, May.
    5. Giovanni Sechi & Paola Zuddas, 2008. "Multiperiod Hypergraph Models for Water Systems Optimization," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 22(3), pages 307-320, March.
    6. Jia Shu & Mabel C. Chou & Qizhang Liu & Chung-Piaw Teo & I-Lin Wang, 2013. "Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems," Operations Research, INFORMS, vol. 61(6), pages 1346-1359, December.
    7. Giovanni M. Sechi & Riccardo Zucca, 2017. "A Cost-Simulation Approach to Finding Economic Optimality in Leakage Reduction for Complex Supply Systems," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(14), pages 4601-4615, November.
    8. Gensler, Sonja & Hinz, Oliver & Skiera, Bernd & Theysohn, Sven, 2012. "Willingness-to-pay estimation with choice-based conjoint analysis: Addressing extreme response behavior with individually adapted designs," European Journal of Operational Research, Elsevier, vol. 219(2), pages 368-378.
    9. Antonio Manca & Giovanni Sechi & Paola Zuddas, 2010. "Water Supply Network Optimisation Using Equal Flow Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 24(13), pages 3665-3678, October.
    10. I N Kamal Abadi, 2007. "A new algorithm for minimizing makespan, C max, in blocking flow-shop problem through slowing down the operations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 134-140, January.
    11. Calvete, Herminia I., 2003. "Network simplex algorithm for the general equal flow problem," European Journal of Operational Research, Elsevier, vol. 150(3), pages 585-600, November.

    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:spr:jcomop:v:11:y:2006:i:4:d:10.1007_s10878-006-8211-9. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.