|
FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
|
A heuristic that maximizes the number of neighbors already in the order, breaking ties by minimizing the domain size, and then by variable name. More...

Classes | |
| class | IntIntStringTuple |
| An (int, int, String) tuple. More... | |
Public Member Functions | |
| MaxWidthMinDom (DCOPProblemInterface<?, ?> problem) | |
| Constructor. | |
| IntIntStringTuple | getScore (List< String > order, String var) |
| Public Member Functions inherited from frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.Heuristic< IntIntStringTuple > | |
| T | getScore (List< String > order, String var) |
| Computes the score of a given variable. | |
Private Attributes | |
| DCOPProblemInterface<?, ?> | problem |
| The agent's subproblem. | |
A heuristic that maximizes the number of neighbors already in the order, breaking ties by minimizing the domain size, and then by variable name.
| frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom.MaxWidthMinDom | ( | DCOPProblemInterface<?, ?> | problem | ) |
| IntIntStringTuple frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom.getScore | ( | List< String > | order, |
| String | var ) |
References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getDomainSize(), and frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getNeighborVars().

|
private |
The agent's subproblem.
Referenced by MaxWidthMinDom().