IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/wp01635.html
   My bibliography  Save this paper

An Exact Formulation and Algorithm for Two Commodity Capacitated Network Design

Author

Listed:
  • Sastry Trilochan

Abstract

We study the capacitated version of the two commodity network design problem, where capacity can be purchased in batches of C units on each arc at a cost of wij greater than equal 0, dk greater than equal 0 units of flow are sent from source to sink for each commodity k. we characterize optimal solutions for the problem with fixed costs and no flow costs, and show that either [dk/C]C or ([dk/C] – 1)C units of each commodity are sent on a shortest path, and the remaining flows possibly share arcs. We show that the problem can be solved in polynomial time. Next, we describe an exact linear programming formulation, i.e., one that guarantees integer optimal solutions, using O(m) variables and O(n) constraints. We also interpret the dual variables and constraints of the formulation as generalizations of the arc constraints and node potential for the shortest path problem. Finally, we discuss several other variations of the single and two commodity problems.

Suggested Citation

  • Sastry Trilochan, 1999. "An Exact Formulation and Algorithm for Two Commodity Capacitated Network Design," IIMA Working Papers WP1999-10-09, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:wp01635
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:iim:iimawp:wp01635. 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/eciimin.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.