Network Design Problem with Cut Constraints

  • Firdovsi Sharifov
  • Hakan Kutucu
Part of the Springer Optimization and Its Applications book series (SOIA, volume 139)


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.


Minimum-cost Network-design Problems Spanning Tree Fundamental Cut Lower Bound Requirement Symmetric Submodular Functions 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    M. Alicherry, R. Bhatia, Y.C. Wan, Designing networks with existing traffic to support fast restoration, in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science, vol. 3122 (Springer, Berlin, 2004), pp. 1–22Google Scholar
  2. 2.
    D. Bienstock, G. Muratore, Strong inequalities for capacitated survivable network design problems. Math. Program. 89, 127–147 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    W.H. Cunningham, Minimum cuts, modular functions, and matroid polyhedra. Networks 15, 205–215 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    W.H. Cunningham, On submodular function minimization. Combinatorica 5(3), 185–192 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    F. Fritzsche, F.B. Holt, More polytope meeting the conjectured Hirsch bound. Discret. Math. 205, 77–84 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    M.X. Goemans, D.P., Williamson, A general approximation technique for constrained forest problems. SIAM J. Comput. 24, 296–317 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    M. Grotschel, C.L. Monma, M. Stoer, Polyhedral and computational investigations for designing communication networks with high survivability requirements. Oper. Res. 43, 1012–1024 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    T.C. Hu, Optimum communication spanning trees. SIAM J. Comput. 3(3) ,188–195 (1974)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    H. Kerivin, A.R. Mahjoub, Separation of partition inequalities for (1, 2) survivable network design problem. Oper. Res. Lett. 30(4), 265–268 (2002)Google Scholar
  10. 10.
    K.V. Marintseva, F.A. Sharifov, G.N. Yun, A problem of airport capacity definition. Aeronautic 5, 1–13 (2013)Google Scholar
  11. 11.
    G.L. Nemhauser, L.A. Wolsey, M.L. Fisher, An analysis of the approximation for maximizing submodular set functions. Math. Program. 14, 265–294 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency in Algorithms and Combinatorics, vol. 24 (Springer, Berlin, 2003)zbMATHGoogle Scholar
  13. 13.
    F.A. Sharifov, Determination of the minimum cut using the base of an extended polymatroid. Cybern. Syst. Anal. 6, 856–867 (1997). Translated from Cybernetics and Systems Analysis 6, 138–152 (1996) (in Russian)Google Scholar
  14. 14.
    F.A. Sharifov, Submodular functions in synthesis of networks. Cybern. Syst. Anal. 37(4), 603–609 (2001). Translated from Kibernetika i Systemnyi Analis 4, 166–174 (2001) (in Russian)Google Scholar
  15. 15.
    F.A. Sharifov, Network Design Problem When Edges of Isomorphic Subgraph Are Deleted, Proceedings (Evry, Paris, 2003), pp. 521–525Google Scholar
  16. 16.
    F.A. Sharifov, Hulianytskyi L.F., Models and complexity of problems of design and reconstruction of telecommunication and transport systems. Cybern. Syst. Anal. 50(5), 693–700 (2014) (in Russian)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    H.D. Sherali, R. Sivanandan, A.G. Hobeika, A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes. Transp. Res. B 28(3), 213–233 (1994)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Firdovsi Sharifov
    • 1
  • Hakan Kutucu
    • 2
  1. 1.V.M. Glushkov Institute of CyberneticsKyivUkraine
  2. 2.Department of Computer EngineeringKarabuk UniversityKarabukTurkey

Personalised recommendations