|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectbnb.BranchAndBound
Finding an optimal permutation (one miniimizing the "mismatched relation" measure, i.e. maximizing energy) by a simple branch-and-bound method. It should produce the same result as exhaustive search, but a bit faster. misRel used internally is twice the misRel computed by Measure.evalMap.
| Field Summary | |
(package private) Absurdist |
absurdist
|
(package private) int[] |
bestMap
|
(package private) double |
bestMisRel
|
(package private) int[] |
map
|
(package private) int |
nn
|
(package private) int |
no
|
(package private) boolean[] |
usedJ
|
| Constructor Summary | |
BranchAndBound(Absurdist absurdist)
|
|
| Method Summary | |
int[] |
getMap()
|
(package private) void |
tryNext(int filledCnt,
double filledMisRel)
|
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
int[] bestMap
double bestMisRel
int no
int nn
Absurdist absurdist
int[] map
boolean[] usedJ
| Constructor Detail |
public BranchAndBound(Absurdist absurdist)
| Method Detail |
public int[] getMap()
void tryNext(int filledCnt,
double filledMisRel)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||