Less Is More: Tabu Search for Bipartite Quadratic Programming Problem

  • Dragan UroševićEmail author
  • Yiad Ibrahim Yousef AlghoulEmail author
  • Zhazira AmirgaliyevaEmail author
  • Nenad MladenovićEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11548)


Having defined a complete bipartite graph G, with weights associated with both vertices and edges, the Bipartite Quadratic Programming problem (BQP) consists in selecting a subgraph that maximizes the sum of the weights associated with the chosen vertices and the edges that connect them. Applications of the BQP arise in mining discrete patterns from binary data, approximation of matrices by rank-one binary matrices, computation of the cut-norm of a matrix, etc. In addition, BQP is also known in the literature under different names such as maximum weighted induced subgraph, maximum weight bi-clique and maximum cut on bipartite graphs. Since the problem is NP-hard, many heuristic methods have been proposed in the literature to solve it. In this paper, we apply the recent Less is more approach, whose basic idea is to design a heuristic as simple as possible, i.e., a method that uses a minimum number of ingredients but provides solutions of better quality than the current state-of-the-art. To reach that goal, we propose a simple hybrid heuristic based on Tabu search, that uses two neighborhood structures and relatively simple rule for implementation of short-term memory operation. In addition, a simple rule for calculation of tabu list length is introduced. Computational results were compared favorably with the current state-of-the-art heuristics. Despite its simplicity, our heuristic was able to find 6 new best known solutions on very well studied test instances.


Discrete optimization Graphs Bipartite quadratic programming Tabu search Variable neighborhood search 



The research has been supported in part by Research Grants 174010 and III 044006 of the Serbian Ministry of Education, Science and Technological Development. The research is also partially covered by the framework of the Grant Number BR05236839 “Development of information technologies and systems for stimulation of personality’s sustainable development as one of the bases of development of digital Kazakhstan”. The research is partly supported by the Ministry of Education and Science, Republic of Kazakhstan (Institute of Information and Computer Technologies), project no. AP05133090.


  1. 1.
    Alon, N., Naor, A.: Approximating the cut-norm via grothendieck’s inequality. SIAM J. Comput. 35(4), 787–803 (2006)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Ambühl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut. SIAM J. Comput. 40(2), 567–596 (2011)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Costa, L.R., Aloise, D., Mladenovic, N.: Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering. Inf. Sci. 415, 247–253 (2017). Scholar
  4. 4.
    Duarte, A., Laguna, M., Martí, R., Sánchez-Oro, J.: Optimization procedures for the bipartite unconstrained 0–1 quadratic programming problem. Comput. Oper. Res. 51, 123–129 (2014)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Galinier, P., Boujbel, Z., Fernandes, M.C.: An efficient memetic algorithm for the graph partitioning problem. Ann. Oper. Res. 19(1), 1–22 (2011)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Gillis, N., Glineur, F.: Low-rank matrix approximation with weights or missing data is np-hard. SIAM J. Matrix Anal. Appl. 32(4), 1149–1165 (2011)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Glover, F., Ye, T., Punnen, A.P., Kochenberger, G.: Integrating tabu search and vlsn search to develop enhanced algorithms: a case study using bipartite boolean quadratic programs. Eur. J. Oper. Res. 241(3), 697–707 (2015)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Hansen, P., Mladenovic, N., Todosijevic, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423–454 (2017)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Karapetyan, D., Punnen, A.P.: Heuristic algorithms for the bipartite unconstrained 0–1 quadratic programming problem. arXiv preprint arXiv:1210.3684 (2012)
  10. 10.
    Karapetyan, D., Punnen, A.P., Parkes, A.J.: Markov chain methods for the bipartite boolean quadratic programming problem. Eur. J. Oper. Res. 260(2), 494–506 (2017)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Mladenovic, N., Todosijevic, R., Urosevic, D.: Less is more: basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326, 160–171 (2016)CrossRefGoogle Scholar
  12. 12.
    Punnen, A.P., Sripratak, P., Karapetyan, D.: The bipartite unconstrained 0–1 quadratic programming problem: polynomially solvable cases. Discrete Applied Mathematics 193(Supplement C), 1–10 (2015)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Silva, K., Aloise, D., de Souza, S.X., Mladenovic, N.: Less is more: simplified Nelder-Mead method for large unconstrained optimization. Yugoslav J. Oper. Res. 28(2), 153–169 (2018). Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Mathematical Institute SASABelgradeSerbia
  2. 2.Emirates College of TechnologiesAbu DhabiUAE
  3. 3.Ural Federal UniversityEkaterinburgRussia
  4. 4.Al-Farabi Kazakh National UniversityAlmatyKazakhstan
  5. 5.Institute of Information and Computational TechnologiesAlmatyKazakhstan

Personalised recommendations