Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

DOI10.1016/S0377-2217(00)00242-3zbMath0990.90524OpenAlexW2047297807MaRDI QIDQ5945202

Hiroyuki Narihisa, Kengo Katayama

Publication date: 10 October 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00242-3

zbMATH Keywords

heuristicslocal searchlarge-size problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items (15)

Problems of discrete optimization: challenges and main approaches to solve them ⋮ Metaheuristic Algorithms ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ Probabilistic GRASP-tabu search algorithms for the UBQP problem ⋮ Modeling and heuristics for production time crashing in supply chain network design ⋮ Diversification-driven tabu search for unconstrained binary quadratic problems ⋮ A hybrid metaheuristic approach to solving the UBQP problem ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ Constructing uniform designs: A heuristic integer programming method ⋮ Optimal dynamic quantizers for discrete-valued input control ⋮ Linear programming based time lag identification in event sequences ⋮ Solving unconstrained binary quadratic programming problem by global equilibrium search ⋮ A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) ⋮ Path relinking for unconstrained binary quadratic programming ⋮ A tight lower bound for a special case of quadratic 0-1 programming

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Experiments in quadratic 0-1 programming
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• Simulated annealing for the unconstrained quadratic pseudo-Boolean function
• The maximum clique problem
• A quadratic assignment formulation of the molecular conformation problem
• Minimization of a quadratic pseudo-Boolean function
• An evolutionary heuristic for quadratic 0-1 programming
• Greedy and local search heuristics for unconstrained binary quadratic programming
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Adaptive Memory Tabu Search for Binary Quadratic Programs
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Quadratic knapsack problems
• An Efficient Heuristic Procedure for Partitioning Graphs
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• Some Network Flow Problems Solved with Pseudo-Boolean Programming
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• A branch and bound algorithm for the maximum clique problem

This page was built for publication: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem