Easy QUBO Solver for solving QUBO problems. More...

#include <tbb/blocked_range.h>
#include <tbb/parallel_for.h>
#include <boost/circular_buffer.hpp>
#include <limits>
#include <random>
#include <set>
#include <thread>
#include <vector>
#include "qbpp.hpp"
#include "qbpp_misc.hpp"

Include dependency graph for qbpp_easy_solver.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	qbpp::easy_solver::RandomSet

class	qbpp::easy_solver::MinSet

class	qbpp::easy_solver::RandomMinSet

class	qbpp::easy_solver::Tabu

class	qbpp::easy_solver::SolDelta

class	qbpp::easy_solver::TabuSolDelta

class	qbpp::easy_solver::PosMinSolDelta

class	qbpp::easy_solver::EasySolver

Namespaces
	qbpp
	Generates a QUBO Expression for the Graph Coloring Problem using QUBO++ library.

	qbpp::easy_solver

Detailed Description

Easy QUBO Solver for solving QUBO problems.

Author: Koji Nakano

EasySolver is a simple QUBO solver that utilizes a greedy algorithm and the Positive Min algorithm with Tabu search. Despite its simplicity, the algorithm is highly effective at escaping local minima. This solver is designed primarily for testing the QUBO++ library, as well as for experimentation, evaluation, and learning purposes. For more details on the Positive Min algorithm, please refer to the following paper:

Hiroshi Kagawa et al., "High-throughput FPGA implementation for quadratic unconstrained binary optimization", Concurr. Comput. Pract. Exp. 35(14) (2023), https://doi.org/10.1002/cpe.6565

Version: 2024-12-24

Definition in file qbpp_easy_solver.hpp.

Classes

Namespaces

Detailed Description