CbabBase::BabLog | Struct storing logging information during B&B prodcedure |
CbabBase::BabNode | Class representing a node in the Branch-and-Bound tree |
CbabBase::BabNodeWithInfo | This class represents an node in the B&B-Tree with additional information attached that is used in selecting nodes or branching variables |
CbabBase::BabTree | Represents the B&B-Tree, manages the way nodes are saved and retrieved and pruned |
CbabBase::Bounds | Auxiliary struct for representing bounds on an optimization variable |
Cmaingo::bab::BranchAndBound | 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 |
CbabBase::Brancher | This class contains the logic for branching on nodes in the B&B-Tree and selecting nodes to be processed |
CbabBase::BranchingHistoryInfo | 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 |
CbabBase::OptimizationVariable::ChangedBounds | Auxiliary struct for storing changed bounds of an optimization variable |
Cmaingo::Constraint | Struct for storing information about constraints |
Cmaingo::ConstraintContainer | Containter for constraint evaluation |
Cmaingo::lbp::DagObj | Struct for storing all needed Directed acyclic Graph objects for the upper bounding solver |
Cmaingo::ubp::DagObj | Struct for storing all needed Directed acyclic Graph objects for the upper bounding solver |
Cmaingo::EvaluationContainer | Struct for storing the values returned by model evaluation at the given point "var" |
▼Cexception | |
CbabBase::BranchAndBoundBaseException | This class defines the exceptions thrown by BranchAndBoundBase |
Cmaingo::MAiNGOException | This class defines the exceptions thrown by MAiNGO |
▼CKTRProblem | |
Cmaingo::ubp::KnitroProblem | Class for representing problems to be solved by Knitro, providing an interface to the problem definition in problem.h |
Cmaingo::lbp::LbpDualInfo | Container for information from the LBP that is needed in DBBT and probing, used for communicating the results via bab |
Cmaingo::Logger | This class contains all logging and output information |
▼Cmaingo::lbp::LowerBoundingSolver | Wrapper for handling the lower bounding problems as well as optimization-based bounds tightening (OBBT) |
Cmaingo::lbp::LbpClp | Wrapper for handling the lower bounding problems by interfacing CLP |
Cmaingo::lbp::LbpCplex | Wrapper for handling the lower bounding problems by interfacing CPLEX |
Cmaingo::lbp::LbpInterval | 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 |
Cmaingo::MAiNGO | This class is the MAiNGO solver holding the B&B tree, upper bounding solver, lower bounding solver and settings |
Cmaingo::MaingoEvaluator | Evaluates ALE expressions to Var |
▼Cmaingo::MAiNGOmodel | This class is the base class for models to be solved by MAiNGO |
Cmaingo::AleModel | This class provides the interface for a program composed of ALE expressions |
Cmaingo::MAiNGOmodelEpsCon | This class is the base class for implementing bi-objective problems |
Cmaingo::modelFunction | Struct for making work with the EvaluationContainer easier for the user and also to ensure backward compatibility |
CbabBase::NodePriorityComparator | Functor for comparing node priorities |
Cmc::Op< maingo::ubp::UbpQuadExpr > | Specialization of the structure mc::Op for use of the type UbpQuadExpr as a template parameter in other MC++ types |
CbabBase::OptimizationVariable | Class for representing an optimization variable specified by the user |
Cmaingo::OutputVariable | Struct for storing additional output variables |
CbabBase::OutVar< T > | Helper class that can be used to enforce the caller to explicitly state that the variable he passed may be changed |
▼Cparser | |
Cmaingo::ProgramParser | Parser specialization for parsing a maingo::Program |
Cmaingo::Program | Container Class for ALE expressions comprising an optimization problem |
CbabBase::PruningScoreComparator | Functor for comparing pruning scores |
Cmaingo::Settings | Struct for storing settings for MAiNGO |
Cmaingo::SymbolFinder | Visitor for finding all symbols used in an expression |
▼CTNLP | |
Cmaingo::ubp::IpoptProblem | Class for representing problems to be solved by IpOpt, providing an interface to the problem definition in problem.h used by MC++ |
Cmaingo::ubp::UbpQuadExpr | 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 |
Cmaingo::ubp::UbpStructure | Struct for storing structure information for the upper bounding solver |
▼Cmaingo::ubp::UpperBoundingSolver | Base class for wrappers for handling the upper bounding problems |
Cmaingo::ubp::UbpClp | Wrapper for handling the upper bounding problems by interfacing CLP |
Cmaingo::ubp::UbpCplex | Wrapper for handling the upper bounding problems by interfacing CPLEX |
Cmaingo::ubp::UbpIpopt | Wrapper for handling the upper bounding problems by interfacing Ipopt |
Cmaingo::ubp::UbpKnitro | Wrapper for handling the upper bounding problems by interfacing Knitro |
Cmaingo::ubp::UbpNLopt | Wrapper for handling the upper bounding problems by interfacing NLopt |
Cmaingo::VariableLister | Serializes a given symbol and lists it into a vector |