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

DOI10.1016/j.cor.2022.106077OpenAlexW4308580601MaRDI QIDQ2108178

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

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

tabu searchgraph theorybinary quadratic programminghybrid metaheuristic

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid metaheuristic approach to solving the UBQP problem
• Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees
• A polynomially solvable class of quadratic semi-assignment problems
• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
• The Boolean quadratic programming problem with generalized upper bound constraints
• An effective iterated tabu search for the maximum bisection problem
• Markov chain methods for the bipartite Boolean quadratic programming problem
• Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem
• Path relinking for unconstrained binary quadratic programming
• Adaptive tabu search for course timetabling
• General forms of the quadratic assignment problem
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
• Clique Relaxation Models in Social Network Analysis
• Convex quadratic and semidefinite programming relaxations in scheduling
• Transfer Optimization in a Transit Network

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