BcpsBranchObject | BcpsBranchObject contains the member data required when choosing branching entities and excuting actual branching |
BcpsBranchStrategy | Branching strategy specifies: (1) how to select a candidate set of branching objects (2) how to compare two branching objects |
BcpsConstraint | |
BcpsConstraintPool | |
BcpsFieldListMod< T > | This class contains modifications for a single std::vector<T> object |
BcpsMessage | |
BcpsModel | |
BcpsNodeDesc | For a given type, the objectVecStorage_ structure holds the description |
BcpsObject | A class for describing the objects that comprise a BCPS subproblem |
BcpsObjectListMod | Here is the set of vectorMod_ objects that represent the list of objects of a particular type (either in relative or explicit form) |
BcpsObjectPool | Object pool is used to store objects |
BcpsSolution | This class holds the solution objects |
BcpsSubTree | This class is the data structure for storing a subtree within BCPS |
BcpsTreeNode | This class contain the data for a BCPS search tree node |
BcpsVariable | |
BcpsVariablePool | |
BlisBranchObjectInt | |
BlisBranchStrategyPseudo | Blis branching strategy default class This class implements a simple default algorithm, betterBranchObject(), for choosing a branching variable |
BlisBranchStrategyRel | Blis branching strategy default class This class implements a simple default algorithm, betterBranchObject(), for choosing a branching variable |
BlisBranchStrategyStrong | Blis branching strategy default class This class implements a simple default algorithm, betterBranchObject(), for choosing a branching variable |
BlisConGenerator | Interface between Blis and Cut Generation Library |
BlisConstraint | |
BlisHeuristic | Heuristic base class |
BlisHeurRound | Rounding Heuristic |
BlisMessage | |
BlisModel | |
BlisNodeDesc | |
BlisObjectInt | |
BlisParams | |
BlisPseudocost | |
BlisSolution | This class contains the solutions generated by the LP solver (either primal or dual |
BlisStrong | |
BlisTreeNode | This is the class in which we are finally able to concretely define the bounding procedure |
BlisVariable |