Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables

DOI10.1016/j.cor.2018.10.009zbMath1458.90504OpenAlexW2897524080WikidataQ129108979 ScholiaQ129108979MaRDI QIDQ1628128

Xue Yang, Zhen Shang, Jin-Kao Hao, Fuda Ma, Songzheng Zhao

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.10.009

zbMATH Keywords

tabu searchgraph theorybinary quadratic programminghybrid metaheuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• The bipartite quadratic assignment problem and extensions
• Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
• A tabu search based memetic algorithm for the Max-Mean dispersion problem
• Constraint-based very large-scale neighborhood search
• A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
• A survey of very large-scale neighborhood search techniques
• Nuclear norm minimization for the planted clique and biclique problems
• A continuous characterization of the maximum-edge biclique problem
• Maximum induced subgraph of a recursive circulant
• On clustering problems with connected optima in Euclidean spaces
• Weakly bipartite graphs and the max-cut problem
• Generalized bilinear programming: An application in farm management
• The maximum edge biclique problem is NP-complete
• An effective iterated tabu search for the maximum bisection problem
• Markov chain methods for the bipartite Boolean quadratic programming problem
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
• Advanced Scatter Search for the Max-Cut Problem
• Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
• Bilinear programming: An exact algorithm
• Randomized heuristics for the Max-Cut problem
• An induced subgraph characterization of domination perfect graphs
• A solution to the matrix factorization problem
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem