A large population island framework for the unconstrained binary quadratic problem

DOI10.1016/J.COR.2024.106684MaRDI QIDQ6979464zbMATH OpenFDO

Authors Olivier Goudet, Adrien Goëffon, Jin-Kao Hao

Publication date 26 May 2025

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

Full work available at URL https://doi.org/10.1016/J.COR.2024.106684

zbMATH Keywords

combinatorial optimizationevolutionary searchheuristicsisland modelparallel searchquadratic unconstrained binary optimizationunconstrained binary quadratic problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• A hybrid metaheuristic approach to solving the UBQP problem
• A multiple search operator heuristic for the max-k-cut problem
• An algorithm for quadratic zero-one programs
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
• An unconstrained quadratic binary programming approach to the vertex coloring problem
• Applications and computational advances for solving the QUBO model
• BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
• Clustering of microarray data via clique partitioning
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Diversification-driven tabu search for unconstrained binary quadratic problems
• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
• Fast heuristics and approximation algorithms
• Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
• Fundamentals of scatter search and path relinking
• Greedy and local search heuristics for unconstrained binary quadratic programming
• Metaheuristic algorithms
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• On the impact of the migration topology on the island model
• Partition Crossover for Pseudo-Boolean Optimization
• Path relinking for unconstrained binary quadratic programming
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• Simulated annealing for the unconstrained quadratic pseudo-Boolean function
• Solving group technology problems via clique partitioning
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Solving the maxcut problem by the global equilibrium search
• Solving unconstrained binary quadratic programming problem by global equilibrium search
• Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• The maximum clique problem
• The unconstrained binary quadratic programming problem: a survey

Cited in

(1)

• Enhanced open-source scatter search algorithm for solving quadratic unconstrained binary optimization problems

This page was built for publication: A large population island framework for the unconstrained binary quadratic problem

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