Journal ArticleDOI
Simulated annealing for the unconstrained quadratic pseudo-Boolean function
TLDR
Computational results and comparisons demonstrate the efficiency of the simulated annealing (SA) based heuristic in terms of solution quality and computational time for the unconstrained quadratic pseudo-Boolean function.About:
This article is published in European Journal of Operational Research.The article was published on 1998-08-01. It has received 49 citations till now. The article focuses on the topics: Quadratic unconstrained binary optimization & Adaptive simulated annealing.read more
Citations
More filters
Journal ArticleDOI
The unconstrained binary quadratic programming problem: a survey
TL;DR: The literature on the unconstrained binary quadratic program is surveyed, providing an overview of the applications and solution methods.
Journal ArticleDOI
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
TL;DR: A family of local-search-based heuristics for Quadratic Unconstrained Binary Optimization (QUBO), all of which start with a (possibly fractional) initial point, sequentially improving its quality by rounding or switching the value of one variable, until arriving to a local optimum.
Journal ArticleDOI
Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
Kengo Katayama,Hiroyuki Narihisa +1 more
TL;DR: In this article, a simulated annealing (SA)-based heuristic for the unconstrained binary quadratic programming problem (BQP) is presented, which is based on a simple (1-opt) local search heuristic and designed with a simple cooling schedule.
Journal ArticleDOI
Memetic algorithms for the unconstrained binary quadratic programming problem.
Peter Merz,Kengo Katayama +1 more
TL;DR: A memetic algorithm, a highly effective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic programming problem (BQP), which includes a new variation operator that has been tailored specially for the application in the hybrid evolutionary framework.
Journal ArticleDOI
Diversification-driven tabu search for unconstrained binary quadratic problems
TL;DR: This paper describes a Diversification-Driven Tabu Search (D2TS) algorithm for solving unconstrained binary quadratic problems that is highly competitive in terms of both solution quality and computational efficiency relative to some of the best performing heuristics in the literature.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Journal ArticleDOI
A linear-time algorithm for testing the truth of certain quantified boolean formulas☆
TL;DR: A simple constructive algorithm for the evaluation of formulas having two literals per clause, which runs in linear time on a random access machine.