Probabilistic GRASP-tabu search algorithms for the UBQP problem
From MaRDI portal
Publication:336712
DOI10.1016/j.cor.2011.12.006zbMath1348.90557OpenAlexW2056057431MaRDI QIDQ336712
Zhipeng Lü, Jin-Kao Hao, Fred Glover, 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
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)
Related Items
\(f\)-flip strategies for unconstrained binary quadratic programming, A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem, Metaheuristic Algorithms, Building an iterative heuristic solver for a quantum annealer, Solving the maximum vertex weight clique problem via binary quadratic programming, An effective iterated tabu search for the maximum bisection problem, Memetic search for the max-bisection problem, Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation, The unconstrained binary quadratic programming problem: a survey, Adaptive randomization in network data, Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem, A multiple search operator heuristic for the max-k-cut problem, The generalized independent set problem: polyhedral analysis and solution approaches, The directed profitable rural postman problem with incompatibility constraints, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the maxcut problem by the global equilibrium search
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A hybrid metaheuristic approach to solving the UBQP problem
- 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)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- An evolutionary heuristic for quadratic 0-1 programming
- A unified modeling and solution framework for combinatorial optimization problems
- Obtaining test problems via Internet
- 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
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Advanced Scatter Search for the Max-Cut Problem
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Tabu Search—Part I
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Randomized heuristics for the Max-Cut problem
- A Decomposition Method for Quadratic Zero-One Programming
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
