New approach to solve unconstrained binary quadratic problem

DOI10.1051/ro/2024087MaRDI QIDQ6658442

Jida Bassem, Battikh Rabih, Alabboud Hassan, Yassine Adnan

Publication date: 8 January 2025

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

zbMATH Keywords

semidefinite programmingbranch and bound methodhybrid algorithmmetaheuristic algorithmsbinary unconstrained quadratic programmingfixing criteria

Mathematics Subject Classification ID

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

Cites Work

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

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