Advertisement

Computational Optimization and Applications

, Volume 74, Issue 3, pp 895–918 | Cite as

Two new integer linear programming formulations for the vertex bisection problem

  • Norberto Castillo-García
  • Paula Hernández HernándezEmail author
Article

Abstract

The vertex bisection problem (VBP) is an NP-hard combinatorial optimization problem with important practical applications in the context of network communications. The problem consists in finding a partition of the set of vertices of a generic undirected graph into two subsets (A and B) of approximately the same cardinality in such a way that the number of vertices in A with at least one adjacent vertex in B is minimized. In this article, we propose two new integer linear programming (ILP) formulations for VBP. Our first formulation (ILPVBP) is based on the redefinition of the objective function of VBP. The redefinition consists in computing the objective value from the vertices in B rather than from the vertices in A. As far as we are aware, this is the first time that this representation is used to solve VBP. The second formulation (MILP) reformulates ILPVBP in such a way that the number of variables and constraints is reduced. In order to assess the performance of our formulations, we conducted a computational experiment and compare the results with the best ILP formulation available in the literature (ILPLIT). The experimental results clearly indicate that our formulations outperform ILPLIT in (i) average objective value, (ii) average computing time and (iii) number of optimal solutions found. We statistically validate the results of the experiment through the well-known Wilcoxon rank sum test for a confidence level of 99.9%. Additionally, we provide 404 new optimal solutions and 73 new upper and lower bounds for 477 instances from 13 different groups of graphs.

Keywords

Vertex bisection problem Exact optimization Linear programming 

Notes

Acknowledgements

The authors would like to thank Tecnológico Nacional de México, and especially the authorities of Instituto Tecnológico de Altamira for their support in this research. We also thank the Mexican Council for Science and Technology (CONACYT) for its support through the Mexican National System of Researchers (SNI) (Grant Nos. 72282, SNI-70157). We are deeply grateful with Pallavi Jain and her research group for kindly sharing some of the instances used in this study.

Supplementary material

10589_2019_119_MOESM1_ESM.tar.gz
Supplementary material 1 (gz 9038 KB)

References

  1. 1.
    Díaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313–356 (2002)CrossRefGoogle Scholar
  2. 2.
    Fleischer, U.B.D.: Vertex bisection is hard, too. J. Graph Algorithms Appl. 13(2), 119–131 (2009)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Fraire, H., Terán-Villanueva, J.D., Castillo-García, N., González Barbosa, J.J., Rodríguez del Ángel, E., Gómez Rojas, Y.: Exact methods for the vertex bisection problem. In: Recent Advances on Hybrid Approaches for Designing Intelligent Systems, pp. 567–577. Springer (2014)Google Scholar
  4. 4.
    Hager, W.W., Hungerford, J.T., Safro, I.: A multilevel bilinear programming algorithm for the vertex separator problem. Comput. Optim. Appl. 69(1), 189–223 (2018)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Hager, W.W., Krylyuk, Y.: Graph partitioning and continuous quadratic programming. SIAM J. Discrete Math. 12(4), 500–523 (1999)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Jain, P., Saran, G., Srivastava, K.: Branch and bound algorithm for vertex bisection minimization problem. In: Advanced Computing and Communication Technologies, pp. 17–23. Springer (2016)Google Scholar
  7. 7.
    Jain, P., Saran, G., Srivastava, K.: A new integer linear programming and quadratically constrained quadratic programming formulation for vertex bisection minimization problem. J. Autom. Mobile Robot. Intell. Syst. 10, 69–73 (2016)Google Scholar
  8. 8.
    Jain, P., Saran, G., Srivastava, K.: On minimizing vertex bisection using a memetic algorithm. Inf. Sci. 369, 765–787 (2016)CrossRefGoogle Scholar
  9. 9.
    Karpinski, M.: Approximability of the minimum bisection problem: an algorithmic challenge. In: International Symposium on Mathematical Foundations of Computer Science, pp. 59–67. Springer (2002)Google Scholar
  10. 10.
    Klasing, R.: The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width. Discrete Appl. Math. 83(1–3), 229–246 (1998)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Rendl, F., Sotirov, R.: The min-cut and vertex separator problem. Comput. Optim. Appl. 69(1), 159–187 (2018)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Sánchez-Oro, J., Pantrigo, J.J.,, Duarte, A.: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem. Comput. Oper. Res. 52, 209–219 (2014)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Software, R.: http://www.r-project.org/. The R Project for Statistical Computing. Version 3.4.0. (2017)
  14. 14.
    Wilcoxon, F.: Individual comparisons by ranking methods. Biom. Bull. 1(6), 80–83 (1945)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of EngineeringTecnológico Nacional de México/I.T. AltamiraAltamiraMexico

Personalised recommendations