Probabilistic GRASP-tabu search algorithms for the UBQP problem

DOI10.1016/J.COR.2011.12.006zbMATH Open1348.90557OpenAlexW2056057431MaRDI QIDQ336712FDOQ336712

Authors: Zhipeng Lü, Fred Glover, Jin-Kao Hao, Yang Wang 

Publication date: 10 November 2016

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

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

Recommendations

• A hybrid metaheuristic approach to solving the UBQP problem
• Diversification-driven tabu search for unconstrained binary quadratic problems
• Path relinking for unconstrained binary quadratic programming
• The unconstrained binary quadratic programming problem: a survey
• Iterated tabu search for the unconstrained binary quadratic optimization problem

zbMATH Keywords

tabu searchpath relinkingGRASPMaxCutpopulation managementUBQP

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Cites Work

• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• Title not available (Why is that?)
• On the notion of balance of a signed graph
• Tabu Search—Part I
• Obtaining test problems via Internet
• A unified modeling and solution framework for combinatorial optimization problems
• Title not available (Why is that?)
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• A Decomposition Method for Quadratic Zero-One Programming
• Title not available (Why is that?)
• Adaptive memory tabu search for binary quadratic programs
• A hybrid metaheuristic approach to solving the UBQP problem
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• An evolutionary heuristic for quadratic 0-1 programming
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Advanced scatter search for the max-cut problem
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Randomized heuristics for the Max-Cut problem
• Solving the maxcut problem by the global equilibrium search
• Iterated tabu search for the unconstrained binary quadratic optimization problem
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
• Diversification-driven tabu search for unconstrained binary quadratic problems
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Cited In (20)

• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
• \(f\)-flip strategies for unconstrained binary quadratic programming
• The unconstrained binary quadratic programming problem: a survey
• An effective iterated tabu search for the maximum bisection problem
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• The directed profitable rural postman problem with incompatibility constraints
• Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
• Solving the maximum vertex weight clique problem via binary quadratic programming
• Metaheuristic algorithms
• Path relinking for unconstrained binary quadratic programming
• A hybrid metaheuristic approach to solving the UBQP problem
• Memetic search for the max-bisection problem
• Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints
• Adaptive randomization in network data
• Diversification-driven tabu search for unconstrained binary quadratic problems
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
• Building an iterative heuristic solver for a quantum annealer
• A multiple search operator heuristic for the max-k-cut problem
• Exact and heuristic solution approaches for the generalized independent set problem
• The generalized independent set problem: polyhedral analysis and solution approaches

Uses Software

• CirCut
• Tabu search

This page was built for publication: Probabilistic GRASP-tabu search algorithms for the UBQP problem

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