Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
type: Item
instance of: scholarly article
title: Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
zbMATH Open document ID: 1458.90504
author: Zhen Shang
author: Songzheng Zhao
author: Jin-Kao Hao
author: Xue Yang
author: Fuda Ma
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6988150
zbMATH Keywords: binary quadratic programming
zbMATH Keywords: tabu search
zbMATH Keywords: hybrid metaheuristic
zbMATH Keywords: graph theory
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2018.10.009
OpenAlex ID: W2897524080
cites work: A survey of very large-scale neighborhood search techniques
cites work: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
cites work: Nuclear norm minimization for the planted clique and biclique problems
cites work: Generalized bilinear programming: An application in farm management
cites work: On clustering problems with connected optima in Euclidean spaces
cites work: Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
cites work: Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
cites work: Randomized heuristics for the Max-Cut problem
cites work: Bilinear programming: An exact algorithm
cites work: A continuous characterization of the maximum-edge biclique problem
cites work: Q4354785
cites work: Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
cites work: Weakly bipartite graphs and the max-cut problem
cites work: A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
cites work: Markov chain methods for the bipartite Boolean quadratic programming problem
cites work: A tabu search based memetic algorithm for the Max-Mean dispersion problem
cites work: An effective iterated tabu search for the maximum bisection problem
cites work: Advanced scatter search for the max-cut problem
cites work: Q5722598
cites work: Constraint-based very large-scale neighborhood search
cites work: The maximum edge biclique problem is NP-complete
cites work: The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
cites work: The bipartite quadratic assignment problem and extensions
cites work: A solution to the matrix factorization problem
cites work: Maximum induced subgraph of a recursive circulant
cites work: An induced subgraph characterization of domination perfect graphs
Wikidata QID: Q129108979
DOI: 10.1016/J.COR.2018.10.009
description: scientific article; zbMATH DE number 6988150