Here is a list of all namespaces with brief descriptions:
[detail level 123]
| NBonmin | |
| ►NCouenne | General include file for different compilers |
| CAuxRelation | Base class definition for relations between auxiliaries |
| CBiProdDivRel | Identifies 5-tuple of the form |
| CcompareSol | Class for comparing solutions (used in tabu list) |
| CcompExpr | Structure for comparing expressions |
| CcompNode | Structure for comparing nodes in the dependence graph |
| CCouenneAggrProbing | Cut Generator for aggressive BT; i.e., an aggressive probing |
| CCouenneAmplInterface | |
| CCouenneBab | |
| CCouenneBranchingObject | "Spatial" branching object |
| CCouenneBTPerfIndicator | |
| CCouenneChooseStrong | |
| CCouenneChooseVariable | Choose a variable for branching |
| CCouenneComplBranchingObject | "Spatial" branching object for complementarity constraints |
| CCouenneComplObject | OsiObject for complementarity constraints  |
| CCouenneConstraint | Class to represent nonlinear constraints |
| CCouenneCrossConv | Cut Generator that uses relationships between auxiliaries |
| CCouenneCutGenerator | Cut Generator for linear convexifications |
| CCouenneDisjCuts | Cut Generator for linear convexifications |
| ►CCouenneExprMatrix | |
| Ccompare_pair_ind | |
| CCouenneFeasPump | An implementation of the Feasibility pump that uses linearization and Ipopt to find the two sequences of points |
| CCouenneFixPoint | Cut Generator for FBBT fixpoint |
| CCouenneFPpool | Pool of solutions |
| CCouenneFPsolution | Class containing a solution with infeasibility evaluation |
| ►CCouenneInfo | Bonmin class for passing info between components of branch-and-cuts |
| CNlpSolution | Class for storing an Nlp Solution |
| CCouenneInterface | |
| CCouenneIterativeRounding | An iterative rounding heuristic, tailored for nonconvex MINLPs |
| CCouenneMINLPInterface | This is class provides an Osi interface for a Mixed Integer Linear Program expressed as a TMINLP (so that we can use it for example as the continuous solver in Cbc) |
| CCouenneMultiVarProbe | |
| CCouenneObject | OsiObject for auxiliary variables $w=f(x)$ |
| CCouenneObjective | Objective function |
| CCouenneOrbitBranchingObj | "Spatial" branching object |
| CCouenneOSInterface | |
| CCouenneProblem | Class for MINLP problems with symbolic information |
| CCouennePSDcon | Class to represent positive semidefinite constraints ////////////////// |
| CCouenneRecordBestSol | |
| CCouenneScalar | |
| CCouenneSdpCuts | These are cuts of the form |
| CCouenneSetup | |
| CCouenneSolverInterface | Solver interface class with a pointer to a Couenne cut generator |
| CCouenneSOSBranchingObject | |
| CCouenneSOSObject | |
| CCouenneSparseBndVec | |
| CCouenneSparseMatrix | Class for sparse Matrixs (used in modifying distances in FP) |
| ►CCouenneSparseVector | |
| Ccompare_scalars | |
| CCouenneThreeWayBranchObj | Spatial, three-way branching object |
| CCouenneTNLP | Class for handling NLPs using CouenneProblem |
| CCouenneTwoImplied | Cut Generator for implied bounds derived from pairs of linear (in)equalities |
| CCouenneUserInterface | |
| CCouenneVarObject | OsiObject for variables in a MINLP |
| CCouenneVTObject | OsiObject for violation transfer on variables in a MINLP |
| CCouExpr | |
| CDepGraph | Dependence graph |
| CDepNode | Vertex of a dependence graph |
| CDomain | Define a dynamic point+bounds, with a way to save and restore previous points+bounds through a LIFO structure |
| CDomainPoint | Define a point in the solution space and the bounds around it |
| CexprAbs | Class for  |
| CexprAux | Auxiliary variable |
| CexprBinProd | Class for  with  all binary |
| CexprCeil | Class ceiling,  |
| CexprClone | Expression clone (points to another expression) |
| CexprConst | Constant-type operator |
| CexprCopy | |
| CexprCos | Class cosine,  |
| CexprDiv | Class for divisions,  |
| Cexpression | Expression base class |
| CexprEvenPow | Power of an expression (binary operator) with even exponent,  with  constant even |
| CexprExp | Class for the exponential,  |
| CexprFloor | Class floor,  |
| CexprGroup | Class Group, with constant, linear and nonlinear terms:  |
| CExprHess | Expression matrices |
| CexprIf | |
| CexprInv | Class inverse:  |
| CexprIVar | Variable-type operator |
| CExprJac | Jacobian of the problem (computed through Couenne expression classes) |
| CexprLBCos | Class to compute lower bound of a cosine based on the bounds of its arguments |
| CexprLBDiv | Class to compute lower bound of a fraction based on the bounds of both numerator and denominator |
| CexprLBMul | Class to compute lower bound of a product based on the bounds of both factors |
| CexprLBQuad | Class to compute lower bound of a fraction based on the bounds of both numerator and denominator |
| CexprLBSin | Class to compute lower bound of a sine based on the bounds on its arguments |
| CexprLog | Class logarithm,  |
| CexprLowerBound | These are bound expression classes |
| CexprMax | Class for maxima |
| CexprMin | Class for minima |
| CexprMul | Class for multiplications, |
| CexprMultiLin | Another class for multiplications, |
| CexprNorm | Class for  -norms,  |
| CexprOddPow | Power of an expression (binary operator),  with  constant |
| CexprOp | General n-ary operator-type expression: requires argument list |
| CexprOpp | Class opposite,  |
| CexprPow | Power of an expression (binary operator), with constant |
| CexprPWLinear | |
| CexprQuad | Class exprQuad, with constant, linear and quadratic terms |
| CexprSignPow | Power of an expression (binary operator),  with  constant |
| CexprSin | Class for  |
| CexprStore | Storage class for previously evaluated expressions |
| CexprSub | Class for subtraction,  |
| CexprSum | Class sum,  |
| CexprTrilinear | Class for multiplications |
| CexprUBCos | Class to compute lower bound of a cosine based on the bounds of its arguments |
| CexprUBDiv | Class to compute upper bound of a fraction based on the bounds of both numerator and denominator |
| CexprUBMul | Class to compute upper bound of a product based on the bounds of both factors |
| CexprUBQuad | Class to compute upper bound of a fraction based on the bounds of both numerator and denominator |
| CexprUBSin | Class to compute lower bound of a sine based on the bounds on its arguments |
| CexprUnary | Expression class for unary functions (sin, log, etc.) |
| CexprUpperBound | Upper bound |
| CexprVar | Variable-type operator |
| Cfuntriplet | |
| CGlobalCutOff | |
| CInitHeuristic | A heuristic that stores the initial solution of the NLP |
| Ckpowertriplet | |
| CLinMap | |
| CMultiProdRel | Identifies 5-ples of variables of the form |
| CNlpSolveHeuristic | |
| Cpowertriplet | |
| CPowRel | Identifies 5-tuple of the form |
| CQroot | Class that stores result of previous calls to rootQ into a map for faster access |
| CquadElem | |
| CQuadMap | |
| Csimpletriplet | |
| CSmartAsl | |
| CSumLogAuxRel | Identifies 5-ples of variables of the form |
| Ct_chg_bounds | Status of lower/upper bound of a variable, to be checked/modified in bound tightening |
| NIpopt | |
| NOsi |
