Diversification-driven tabu search for unconstrained binary quadratic problems

DOI10.1007/s10288-009-0115-yzbMath1201.90169MaRDI QIDQ607875

Fred Glover, Jin-Kao Hao, Zhipeng Lü

Publication date: 6 December 2010

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-009-0115-y

zbMATH Keywords

tabu search; long-term memory; UBQP; diversification-driven

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

90C27: Combinatorial optimization

80M50: Optimization problems in thermodynamics and heat transfer

Related Items

Probabilistic GRASP-tabu search algorithms for the UBQP problem, The unconstrained binary quadratic programming problem: a survey, A hybrid metaheuristic approach to solving the UBQP problem, An iterated ``hyperplane exploration approach for the quadratic knapsack problem, Path relinking for unconstrained binary quadratic programming, Quadratic bottleneck knapsack problems, On characterization of maximal independent sets via quadratic optimization, Building an iterative heuristic solver for a quantum annealer, Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs, Optimality Conditions for the Minimization of Quadratic 0-1 Problems

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• An unconstrained quadratic binary programming approach to the vertex coloring problem
• Simulated annealing for the unconstrained quadratic pseudo-Boolean function
• The maximum clique problem
• A quadratic assignment formulation of the molecular conformation problem
• An evolutionary heuristic for quadratic 0-1 programming
• Greedy and local search heuristics for unconstrained binary quadratic programming
• A unified modeling and solution framework for combinatorial optimization problems
• Obtaining test problems via Internet
• A new modeling and solution approach for the set-partitioning problem
• A new approach for modeling and solving set packing problems
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• On the notion of balance of a signed graph
• Adaptive Memory Tabu Search for Binary Quadratic Programs
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Quadratic knapsack problems
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• A Decomposition Method for Quadratic Zero-One Programming
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem