FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > > Member List

This is the complete list of members for frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >, including all inherited members.

calculateUB(U[] upperBoundsSum, boolean maximize)frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >
calculateUBTest(U[] upperBoundsSum)frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >
confirmedUtilfrodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >
LeafNode()frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >
LeafNode(int confirmedCounter, int[] powersOf2)frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >
LeafNode(int confirmedCounter, U util, int[] powersOf2)frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >
newInstance(int confirmedCounter, int[] powersOf2)frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >package
newInstance(int confirmedCounter, U util, int[] powersOf2)frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >package
realfrodo2.algorithms.odpop.goodsTree.InnerNodeTree.LeafNode< U >
setInfeasable(U infeasibleUtil)frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >
updateLeafNoUB(frodo2.algorithms.odpop.Good<?, U > g, U utilityDelta, int sender, int[] powersOf2, final boolean maximize)frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >
updateLeafWithUB(frodo2.algorithms.odpop.Good<?, U > g, U utilityDelta, int sender, U[] upperBoundSums, int[] powersOf2, boolean compatibleAssignmentReceived, final boolean maximize)frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >
frodo2::algorithms::odpop::goodsTree::InnerNodeTree::LeafNode< U >.updateLeafWithUB(Good<?, U > g, U utilityDelta, int sender, U[] upperBoundSums, int[] powersOf2, boolean compatibleAssignmentReceived, final boolean maximize)frodo2.algorithms.odpop.goodsTree.InnerNodeTree.LeafNode< U >
utilCandidate(U maxUtil, final boolean maximize)frodo2.algorithms.odpop.goodsTree.InnerNodeTree.LeafNode< U >