New approach to solve unconstrained binary quadratic problem

DOI10.1051/RO/2024087MaRDI QIDQ6658442zbMATH OpenFDO

Authors Battikh Rabih, Alabboud Hassan, Jida Bassem, Yassine Adnan

Publication date 8 January 2025

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2024087

zbMATH Keywords

hybrid algorithmsemidefinite programmingbranch and bound methodmetaheuristic algorithmsbinary unconstrained quadratic programmingfixing criteria

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Semidefinite programming (90C22)

Recommendations

• A hybrid metaheuristic approach to solving the UBQP problem
• The unconstrained binary quadratic programming problem: a survey
• The application of binary accelerated particle swarm optimization method to unconstrained binary quadratic problems
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
• Solving unconstrained binary quadratic programming problem by global equilibrium search

Cites work

• Adaptive memory tabu search for binary quadratic programs
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• An evolutionary heuristic for quadratic 0-1 programming
• Branch-and-Bound Methods: General Formulation and Properties
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Equation of state calculations by fast computing machines
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Optimization by simulated annealing
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
• Support vector machines on the D-wave quantum annealer
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

This page was built for publication: New approach to solve unconstrained binary quadratic problem

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