toysolver-0.6.0: Assorted decision procedures for SAT, SMT, Max-SAT, PB, MIP, etc

Copyright(c) Masahiro Sakai 2018
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilitynon-portable
Safe HaskellNone
LanguageHaskell2010

ToySolver.QUBO

Contents

Description

 
Synopsis

QUBO (quadratic unconstrained boolean optimization)

data Problem a Source #

QUBO (quadratic unconstrained boolean optimization) problem.

Minimize \(\sum_{i\le j} Q_{i,j} x_i x_j\) where \(x_i \in \{0,1\}\) for \(i \in \{0 \ldots N-1\}\).

In the Solution type. 0 and 1 are represented as False and True respectively.

Constructors

Problem 

Fields

Instances
Functor Problem Source # 
Instance details

Defined in ToySolver.QUBO

Methods

fmap :: (a -> b) -> Problem a -> Problem b #

(<$) :: a -> Problem b -> Problem a #

Eq a => Eq (Problem a) Source # 
Instance details

Defined in ToySolver.QUBO

Methods

(==) :: Problem a -> Problem a -> Bool #

(/=) :: Problem a -> Problem a -> Bool #

Show a => Show (Problem a) Source # 
Instance details

Defined in ToySolver.QUBO

Methods

showsPrec :: Int -> Problem a -> ShowS #

show :: Problem a -> String #

showList :: [Problem a] -> ShowS #

FileFormat (Problem Scientific) Source # 
Instance details

Defined in ToySolver.QUBO

eval :: Num a => Solution -> Problem a -> a Source #

Ising Model

data IsingModel a Source #

Ising model.

Minimize \(\sum_{i<j} J_{i,j} \sigma_i \sigma_j + \sum_i h_i \sigma_i\) where \(\sigma_i \in \{-1,+1\}\) for \(i \in \{0 \ldots N-1\}\).

In the Solution type. -1 and +1 are represented as False and True respectively.

Constructors

IsingModel 

Fields

Instances
Eq a => Eq (IsingModel a) Source # 
Instance details

Defined in ToySolver.QUBO

Methods

(==) :: IsingModel a -> IsingModel a -> Bool #

(/=) :: IsingModel a -> IsingModel a -> Bool #

Show a => Show (IsingModel a) Source # 
Instance details

Defined in ToySolver.QUBO