IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-94830-0_11.html
   My bibliography  Save this book chapter

Network Design Problem with Cut Constraints

In: Optimization Problems in Graph Theory

Author

Listed:
  • Firdovsi Sharifov

    (V.M. Glushkov Institute of Cybernetics)

  • Hakan Kutucu

    (Karabuk University)

Abstract

In this paper, we introduce a minimum cost network design problem with a given lower bound requirement for capacity of any cut. First, we consider the subproblem including the lower bound requirement only for each fundamental cut determined by deleting edges from some spanning tree. Then, it is shown that the simplex algorithm finds an optimal solution to standard LP-relaxation of the subproblem in the linear time of the number of edges. The simplex and minimum cut algorithms are used in a Branch-and-Cut type algorithm to pick up a solution to the minimum cost network design problem.

Suggested Citation

  • Firdovsi Sharifov & Hakan Kutucu, 2018. "Network Design Problem with Cut Constraints," Springer Optimization and Its Applications, in: Boris Goldengorin (ed.), Optimization Problems in Graph Theory, pages 265-292, Springer.
    • Handle: RePEc:spr:spochp:978-3-319-94830-0_11
    DOI: 10.1007/978-3-319-94830-0_11
    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.

    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:spochp:978-3-319-94830-0_11. 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: 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.