Package org.jacop.examples.fd
Class BIBD
java.lang.Object
org.jacop.examples.fd.ExampleFD
org.jacop.examples.fd.BIBD
It models and solves Balanced Incomplete Block Design (BIBD) problem (CSPLIB-P28).
- Version:
- 4.10
-
Field Summary
FieldsModifier and TypeFieldDescriptionint
It specifies number of columns in the incidence matrix.int
It specifies number of ones in each column.int
It specifies the value of the scalar product of any two distinct rows.int
It specifies number of ones in each row.int
It specifies number of rows in the incidence matrix.(package private) IntVar[][]
-
Constructor Summary
Constructors -
Method Summary
Methods inherited from class org.jacop.examples.fd.ExampleFD
creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch
-
Field Details
-
v
public int vIt specifies number of rows in the incidence matrix. -
b
public int bIt specifies number of columns in the incidence matrix. -
r
public int rIt specifies number of ones in each row. -
k
public int kIt specifies number of ones in each column. -
lambda
public int lambdaIt specifies the value of the scalar product of any two distinct rows. -
x
IntVar[][] x
-
-
Constructor Details
-
BIBD
public BIBD()
-
-
Method Details
-
model
public void model()Description copied from class:ExampleFD
It specifies a standard way of modeling the problem. -
main
It executes the program to solve the Langford problem. It is possible to specify two parameters. If no parameter is used then default values for n and m are used.- Parameters:
args
- the first parameter denotes n, the second parameter denotes m.
-