| _m_bestNode | BGIP_SolverBranchAndBound< JP > | private |
| _m_bgip | BGIP_SolverBranchAndBound< JP > | private |
| _m_CBGlowerBound | BGIP_SolverBranchAndBound< JP > | private |
| _m_CBGupperBound | BGIP_SolverBranchAndBound< JP > | private |
| _m_completeInformationValues | BGIP_SolverBranchAndBound< JP > | private |
| _m_depthFirstSpecified | BGIP_SolverBranchAndBound< JP > | private |
| _m_expandAll | BGIP_SolverBranchAndBound< JP > | private |
| _m_jaToIndCache | BGIP_SolverBranchAndBound< JP > | private |
| _m_jtIndexMapping | BGIP_SolverBranchAndBound< JP > | private |
| _m_jtOrdering | BGIP_SolverBranchAndBound< JP > | private |
| _m_maxDepth | BGIP_SolverBranchAndBound< JP > | private |
| _m_maxLowerBound | BGIP_SolverBranchAndBound< JP > | private |
| _m_nrActions | BGIP_SolverBranchAndBound< JP > | private |
| _m_nrAgents | BGIP_SolverBranchAndBound< JP > | private |
| _m_nrJTs | BGIP_SolverBranchAndBound< JP > | private |
| _m_nrNodesExpanded | BGIP_SolverBranchAndBound< JP > | private |
| _m_nrNodesFullySpecified | BGIP_SolverBranchAndBound< JP > | private |
| _m_nrNodesPruned | BGIP_SolverBranchAndBound< JP > | private |
| _m_nrSolutionsComputed | BGIP_SolverBranchAndBound< JP > | private |
| _m_nrSolutionsReturned | BGIP_IncrementalSolverInterface | protected |
| _m_openQueue | BGIP_SolverBranchAndBound< JP > | private |
| _m_reComputeH | BGIP_SolverBranchAndBound< JP > | private |
| _m_reComputeJTIndexMapping | BGIP_SolverBranchAndBound< JP > | private |
| _m_solved | BGIP_SolverBranchAndBound< JP > | private |
| _m_verbosity | BGIP_SolverBranchAndBound< JP > | private |
| AddSolution(const JointPolicyPureVector &jp, double value) | BayesianGameIdenticalPayoffSolver | inline |
| AddSolution(const JointPolicyPureVectorForClusteredBG &jp, double value) | BayesianGameIdenticalPayoffSolver | inline |
| AddSolution(LIndex jpolIndex, double value) | BayesianGameIdenticalPayoffSolver | inline |
| AllSolutionsHaveBeenReturned() const | BGIP_IncrementalSolverInterface | inline |
| BayesianGameIdenticalPayoffSolver(const boost::shared_ptr< const BayesianGameIdenticalPayoffInterface > &bg, size_t nrDesiredSolutions=1) | BayesianGameIdenticalPayoffSolver | |
| BGIP_IncrementalSolverInterface(const boost::shared_ptr< const BayesianGameIdenticalPayoffInterface > &bg, size_t nrDesiredSolutions=INT_MAX) | BGIP_IncrementalSolverInterface | inline |
| BGIP_IncrementalSolverInterface_T(const boost::shared_ptr< const BayesianGameIdenticalPayoffInterface > &bg, size_t nrDesiredSolutions=INT_MAX) | BGIP_IncrementalSolverInterface_T< JP > | inline |
| BGIP_SolverBranchAndBound(const boost::shared_ptr< const BayesianGameIdenticalPayoffInterface > &bg, int verbose=0, size_t nrDesiredSolutions=1, bool expandAll=false, BGIP_BnB::BnB_JointTypeOrdering jtOrdering=BGIP_BnB::IdentityMapping, bool reComputeHeur=false) | BGIP_SolverBranchAndBound< JP > | inline |
| CheckDeadline(const std::string &errorMessage) const | BayesianGameIdenticalPayoffSolver | protectedvirtual |
| ComputeCompleteInformationValues() | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ComputeMinContributionValues() const | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ComputeValidJointActionExtensions(BGIP_BnB_NodePtr node, std::vector< Index > &valid_JAs) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ComputeValidJointActions(Index jt_bgI, std::vector< Index > &valid_JAs, BGIP_BnB_NodePtr node) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ComputeValidJointActionsOld(BGIP_BnB_NodePtr node, Index jt_bgI, std::vector< Index > &valid_JAs) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ComputeValueOfFullySpecifiedPolicy(BGIP_BnB_NodePtr node) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ConvertNodeToPolicyAndAddToSolution(BGIP_BnB_NodePtr node, double value) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| Evaluate(const JointPolicyPureVector &jpolBG) const | BayesianGameIdenticalPayoffSolver | |
| Evaluate(const JointPolicyPureVectorForClusteredBG &jpolBG) const | BayesianGameIdenticalPayoffSolver | |
| Expand(BGIP_BnB_NodePtr node, Index JA) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ExpandAllExtensions(BGIP_BnB_NodePtr node) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| GenerateJointActions(const std::vector< Index > &valid_action_set, std::vector< Index > &curr_JA, std::vector< Index > &valid_JAs, Index agentI) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| GenerateJointActions_ProcessAction(const std::vector< Index > &valid_action_set, std::vector< Index > &curr_JA, std::vector< Index > &valid_JAs, Index agentI, Index actionI) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| GetBGIPI() const | BayesianGameIdenticalPayoffSolver | inline |
| GetContribution(Index jtI, Index jaI) const | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| GetDepthFirstSpecified(Index agentI, Index typeI, BGIP_BnB_NodePtr node) const | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| GetExpectedReward() const | BayesianGameIdenticalPayoffSolver | inline |
| GetJointPolicy() const | BayesianGameIdenticalPayoffSolver | inline |
| GetJointPolicyPureVector() const | BayesianGameIdenticalPayoffSolver | inline |
| GetJTIndexMapping(Index i, BGIP_BnB_NodePtr node) const | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| GetNewJpol() const | BGIP_IncrementalSolverInterface_T< JP > | inlinevirtual |
| GetNextJointPolicyAndValue(boost::shared_ptr< JointPolicyDiscretePure > &jpol, double &value) | BGIP_IncrementalSolverInterface | inline |
| GetNextJointPolicyAndValueSpecific(boost::shared_ptr< JointPolicyDiscretePure > &jpol, double &value) | BGIP_SolverBranchAndBound< JP > | inlinevirtual |
| GetNextSolutionJPPV() const | BayesianGameIdenticalPayoffSolver | inline |
| GetNextSolutionPJPDP() const | BayesianGameIdenticalPayoffSolver | inline |
| GetNrDesiredSolutions() const | BayesianGameIdenticalPayoffSolver | inline |
| GetNrFoundSolutions() const | BayesianGameIdenticalPayoffSolver | inline |
| GetNrNodesExpanded() const | BGIP_SolverBranchAndBound< JP > | inline |
| GetPayoff() const | BayesianGameIdenticalPayoffSolver | inline |
| GetPerJPRatio(size_t s) const | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| GetResultsOFStream() const | BayesianGameIdenticalPayoffSolver | inline |
| GetTimingsOFStream() const | BayesianGameIdenticalPayoffSolver | inline |
| GetWriteAnyTimeResults() const | BayesianGameIdenticalPayoffSolver | inline |
| InitDeadline() | BayesianGameIdenticalPayoffSolver | inlineprotectedvirtual |
| IsEmptyJPPV() const | BayesianGameIdenticalPayoffSolver | inline |
| IsEmptyPJPDP() const | BayesianGameIdenticalPayoffSolver | inline |
| IsExactSolver() const | BGIP_SolverBranchAndBound< JP > | inlinevirtual |
| Pop(BGIP_BnB_NodePtr node) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| PopAndDeleteNode(BGIP_BnB_NodePtr node) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| PopNextSolutionJPPV() | BayesianGameIdenticalPayoffSolver | inline |
| PopNextSolutionPJPDP() | BayesianGameIdenticalPayoffSolver | inline |
| PrintStatistics(Index i) const | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ProcessFullySpecifiedNode(BGIP_BnB_NodePtr node) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| Prune(double value) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ReComputeH(BGIP_BnB_NodePtr node) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ReOrderJointTypes(std::vector< Index > &jtIndexMapping) | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ReOrderJointTypes(const std::vector< Index > &origJTIndexMapping, const std::vector< double > &origValues, const std::vector< double > &orderedValues, std::vector< Index > &jtIndexMapping) const | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ReSolve() | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| SaveSolution(const std::string &filename) const | BayesianGameIdenticalPayoffSolver | inline |
| SetAnyTimeResults(bool turn_on, std::ofstream *results, std::ofstream *timings) | BayesianGameIdenticalPayoffSolver | |
| SetCBGlowerBound(double lowerbound) | BGIP_SolverBranchAndBound< JP > | inlinevirtual |
| SetCBGupperBound(double upperbound) | BGIP_SolverBranchAndBound< JP > | inlinevirtual |
| SetDeadline(double deadlineInSeconds) | BayesianGameIdenticalPayoffSolver | inlinevirtual |
| SetNrDesiredSolutions(size_t n) | BayesianGameIdenticalPayoffSolver | inline |
| SoftPrintSolution() const | BayesianGameIdenticalPayoffSolver | inline |
| Solve() | BGIP_SolverBranchAndBound< JP > | inlinevirtual |
| SortAscending(std::vector< double > &values) const | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| SortDescending(std::vector< double > &values) const | BGIP_SolverBranchAndBound< JP > | inlineprivate |
| ~BayesianGameIdenticalPayoffSolver() | BayesianGameIdenticalPayoffSolver | inlinevirtual |
| ~BGIP_IncrementalSolverInterface() | BGIP_IncrementalSolverInterface | inlinevirtual |
| ~BGIP_SolverBranchAndBound() | BGIP_SolverBranchAndBound< JP > | inline |
1.8.8