benchmarkGeneratorMaxCut {CEGO} | R Documentation |
MaxCut Benchmark Creation
Description
Generates MaxCut problems, with binary decision variables. The MaxCut Problems are transformed to minimization problems by negation.
Usage
benchmarkGeneratorMaxCut(N, A)
Arguments
N |
length of the bit strings |
A |
The adjacency matrix of the graph. Will be created at random if not provided. |
Value
the function of type cost=f(bitstring). Returned fitness values will be negative, for purpose of minimization.
Examples
fun <- benchmarkGeneratorMaxCut(N=6)
fun(c(1,0,1,1,0,0))
fun(c(1,0,1,1,0,1))
fun(c(0,1,0,0,1,1))
fun <- benchmarkGeneratorMaxCut(A=matrix(c(0,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0),4,4))
fun(c(1,0,1,0))
fun(c(1,0,1,1))
fun(c(0,1,0,1))
[Package CEGO version 2.4.3 Index]