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

DOI10.1016/J.COR.2022.106077MaRDI QIDQ2108178OpenAlexFDO

Authors Zhen Shang, Jin-Kao Hao, Songzheng Zhao, Yang Wang, Fei Ma

Publication date 19 December 2022

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

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

zbMATH Keywords

graph theorytabu searchbinary quadratic programminghybrid metaheuristic

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• The Boolean quadratic programming problem with generalized upper bound constraints
• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
• Probabilistic GRASP-tabu search algorithms for the UBQP problem

Cites work

• scientific article; zbMATH DE number 915573 (Why is no real title available?)
• A hybrid metaheuristic approach to solving the UBQP problem
• A polynomially solvable class of quadratic semi-assignment problems
• Adaptive tabu search for course timetabling
• An effective iterated tabu search for the maximum bisection problem
• Clique relaxation models in social network analysis
• Convex quadratic and semidefinite programming relaxations in scheduling
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
• Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees
• General forms of the quadratic assignment problem
• Markov chain methods for the bipartite Boolean quadratic programming problem
• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
• Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
• Path relinking for unconstrained binary quadratic programming
• Statistical comparisons of classifiers over multiple data sets
• The Boolean quadratic programming problem with generalized upper bound constraints
• Transfer Optimization in a Transit Network

Cited in

(5)

• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
• The Boolean quadratic programming problem with generalized upper bound constraints
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs

This page was built for publication: Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108178)