▼NbabBase | Namespace holding all essentials of the babBase submodule |
CBabLog | Struct storing logging information during B&B prodcedure |
CBabNode | Class representing a node in the Branch-and-Bound tree |
CBabNodeWithInfo | This class represents an node in the B&B-Tree with additional information attached that is used in selecting nodes or branching variables |
CBabTree | Represents the B&B-Tree, manages the way nodes are saved and retrieved and pruned |
CBounds | Auxiliary struct for representing bounds on an optimization variable |
CBranchAndBoundBaseException | This class defines the exceptions thrown by BranchAndBoundBase |
CBrancher | This class contains the logic for branching on nodes in the B&B-Tree and selecting nodes to be processed |
CBranchingHistoryInfo | Struct for collecting all information that must be saved about a node, so that after it is retrieved from the tree and processed, pseudocosts can be calculated |
CNodePriorityComparator | Functor for comparing node priorities |
▼COptimizationVariable | Class for representing an optimization variable specified by the user |
CChangedBounds | Auxiliary struct for storing changed bounds of an optimization variable |
COutVar | Helper class that can be used to enforce the caller to explicitly state that the variable he passed may be changed |
CPruningScoreComparator | Functor for comparing pruning scores |
▼Nmaingo | Namespace holding all essentials of MAiNGO |
▼Nbab | Namespace holding everything related to the actual branch-and-bound algorithm |
CBranchAndBound | This class contains the main algorithm, including handling of pre-processing routines and managing the B&B tree as well as the respective sub-solvers |
▼Nlbp | Namespace holding all essentials of the lower bounding solver |
CDagObj | Struct for storing all needed Directed acyclic Graph objects for the upper bounding solver |
CLbpClp | Wrapper for handling the lower bounding problems by interfacing CLP |
CLbpCplex | Wrapper for handling the lower bounding problems by interfacing CPLEX |
CLbpDualInfo | Container for information from the LBP that is needed in DBBT and probing, used for communicating the results via bab |
CLbpInterval | Wrapper for handling the lower bounding problems by using interval arithmetics. We currently do a bit too much work, if the subgradient interval heuristic is not used, since we additionally compute the McCormick relaxations |
CLowerBoundingSolver | Wrapper for handling the lower bounding problems as well as optimization-based bounds tightening (OBBT) |
▼Nubp | Namespace holding all essentials of the upper bounding solvers |
CDagObj | Struct for storing all needed Directed acyclic Graph objects for the upper bounding solver |
CIpoptProblem | Class for representing problems to be solved by IpOpt, providing an interface to the problem definition in problem.h used by MC++ |
CKnitroProblem | Class for representing problems to be solved by Knitro, providing an interface to the problem definition in problem.h |
CUbpClp | Wrapper for handling the upper bounding problems by interfacing CLP |
CUbpCplex | Wrapper for handling the upper bounding problems by interfacing CPLEX |
CUbpIpopt | Wrapper for handling the upper bounding problems by interfacing Ipopt |
CUbpKnitro | Wrapper for handling the upper bounding problems by interfacing Knitro |
CUbpNLopt | Wrapper for handling the upper bounding problems by interfacing NLopt |
CUbpQuadExpr | Struct used to compute coefficients of linear and quadratic/bilinear terms in (MIQ)Ps. This struct is used to avoid the need of propagating the IloExpr object resulting in HUGE RAM usage |
CUbpStructure | Struct for storing structure information for the upper bounding solver |
CUpperBoundingSolver | Base class for wrappers for handling the upper bounding problems |
CAleModel | This class provides the interface for a program composed of ALE expressions |
CConstraint | Struct for storing information about constraints |
CConstraintContainer | Containter for constraint evaluation |
CEvaluationContainer | Struct for storing the values returned by model evaluation at the given point "var" |
CLogger | This class contains all logging and output information |
CMAiNGO | This class is the MAiNGO solver holding the B&B tree, upper bounding solver, lower bounding solver and settings |
CMaingoEvaluator | Evaluates ALE expressions to Var |
CMAiNGOException | This class defines the exceptions thrown by MAiNGO |
CMAiNGOmodel | This class is the base class for models to be solved by MAiNGO |
CMAiNGOmodelEpsCon | This class is the base class for implementing bi-objective problems |
CmodelFunction | Struct for making work with the EvaluationContainer easier for the user and also to ensure backward compatibility |
COutputVariable | Struct for storing additional output variables |
CProgram | Container Class for ALE expressions comprising an optimization problem |
CProgramParser | Parser specialization for parsing a maingo::Program |
CSettings | Struct for storing settings for MAiNGO |
CSymbolFinder | Visitor for finding all symbols used in an expression |
CVariableLister | Serializes a given symbol and lists it into a vector |
▼Nmc | Namespace holding forward declaration of McCormick objects. For more info refer to the open-source library MC++ |
COp< maingo::ubp::UbpQuadExpr > | Specialization of the structure mc::Op for use of the type UbpQuadExpr as a template parameter in other MC++ types |