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

Capacitated transportation problem with bounds on RIM conditions

Author

Listed:
  • Dahiya, Kalpana
  • Verma, Vanita

Abstract

No abstract is available for this item.

Suggested Citation

  • Dahiya, Kalpana & Verma, Vanita, 2007. "Capacitated transportation problem with bounds on RIM conditions," European Journal of Operational Research, Elsevier, vol. 178(3), pages 718-737, May.
    • Handle: RePEc:eee:ejores:v:178:y:2007:i:3:p:718-737
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00127-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.

    References listed on IDEAS

    as
    1. A. Charnes & Darwin Klingman, 1970. "Note--The Distribution Problem with Upper and Lower Bounds on the Node Requirements," Management Science, INFORMS, vol. 16(9), pages 638-642, May.
    2. Refael Hassin & Eitan Zemel, 1988. "Probabilistic Analysis of the Capacitated Transportation Problem," Mathematics of Operations Research, INFORMS, vol. 13(1), pages 80-89, February.
    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. Sharma, Anuj & Verma, Vanita & Kaur, Prabhjot & Dahiya, Kalpana, 2015. "An iterative algorithm for two level hierarchical time minimization transportation problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 700-707.
    2. Khurana, Archana & Adlakha, Veena & Lev, Benjamin, 2018. "Multi-index constrained transportation problem with bounds on availabilities, requirements and commodities," Operations Research Perspectives, Elsevier, vol. 5(C), pages 319-333.
    3. Kavita Gupta & Ritu Arora, 2018. "Solving the problem of industry by formulating it as a fractional capacitated transportation problem with bounds on rim conditions," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(2), pages 509-516, April.
    4. Kavita Gupta & Ritu Arora, 2017. "More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 460-474, September.
    5. Xie, Fanrong & Butt, Muhammad Munir & Li, Zuoan & Zhu, Linzhi, 2017. "An upper bound on the minimal total cost of the transportation problem with varying demands and supplies," Omega, Elsevier, vol. 68(C), pages 105-118.
    6. Prabhjot Kaur & Anuj Sharma & Vanita Verma & Kalpana Dahiya, 2022. "An alternate approach to solve two-level hierarchical time minimization transportation problem," 4OR, Springer, vol. 20(1), pages 23-61, March.
    7. Fanrong Xie & Zuoan Li, 2022. "An iterative solution technique for capacitated two-stage time minimization transportation problem," 4OR, Springer, vol. 20(4), pages 637-684, December.

    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. Nanda Piersma, 1999. "A Probabilistic Analysis of the Capacitated Facility Location Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 31-50, July.
    2. Fanrong Xie & Zuoan Li, 2022. "An iterative solution technique for capacitated two-stage time minimization transportation problem," 4OR, Springer, vol. 20(4), pages 637-684, December.
    3. Khurana, Archana & Adlakha, Veena & Lev, Benjamin, 2018. "Multi-index constrained transportation problem with bounds on availabilities, requirements and commodities," Operations Research Perspectives, Elsevier, vol. 5(C), pages 319-333.

    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:178:y:2007:i:3:p:718-737. 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: 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.