Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 123]
  Bonmin | (C) Copyright International Business Machines Corporation 2007 |
   BonminAmplSetup | |
 BabSetupBase | A class to have all elements necessary to setup a branch-and-bound |
| BonminSetup | |
| CbcStrategyChooseCuts | A class to setup default strategy for Cbc specifying which cut generators to use |
| SubMipSolver | A very simple class to provide a common interface for solving MIPs with Cplex and Cbc |
| HotInfo | |
| BonChooseVariable | This class chooses a variable to branch on |
| CurvBranchingSolver | Implementation of BonChooseVariable for curvature-based braching |
| LpBranchingSolver | Implementation of BonChooseVariable for curvature-based braching |
| PseudoCosts | |
| QpBranchingSolver | This class chooses a variable to branch on |
| DummyHeuristic | |
| EcpCuts | |
| MinlpFeasPump | |
| OACutGenerator2 | Class to perform OA in its classical form |
| OaDecompositionBase | Base class for OA algorithms |
| OaFeasibilityChecker | Class to perform OA in its classical form |
| OaMessages | Output messages for Outer approximation cutting planes |
| OaNlpOptim | Generate cuts for the nlp corresponding to continuous relaxation at a node |
| LinearCutsGenerator | |
| OuterApprox | A class to build outer approximations |
| QuadCut | |
| Cuts | Generalizes OsiCuts to handle quadratic cuts |
| QuadRow | Stores a quadratic row of the form l < c + ax + x^T Q x < u |
| TMat | |
| TMINLP2TNLPQuadCuts | This is a derived class fro TMINLP2TNLP to handle adding quadratic cuts |
| TMINLPLinObj | From a TMINLP, this class adapts to another TMINLP where the original objective is transformed into a constraint by adding an extra variable which is minimized |
| BabInfo | Bonmin class for passing info between components of branch-and-cuts |
| Bab | |
| CbcNlpStrategy | |
| BonCbcFullNodeInfo | Holds information for recreating a subproblem by incremental change from the parent for Bonmin |
| BonCbcPartialNodeInfo | Holds information for recreating a subproblem by incremental change from the parent for |
| CbcDiver | Class to do diving in the tree |
| CbcProbedDiver | Class to do probed diving in the tree |
| CbcDfsDiver | A more elaborate diving class |
| DiverCompare | |
| GuessHeuristic | |
| DummyPump | |
| FixAndSolveHeuristic | |
| HeuristicDive | |
| HeuristicDiveFractional | |
| HeuristicDiveMIP | |
| HeuristicDiveMIPFractional | |
| HeuristicDiveMIPVectorLength | |
| HeuristicDiveVectorLength | |
| HeuristicFPump | |
| RoundingFPump | |
| HeuristicLocalBranching | |
| HeuristicRINS | |
| LocalSolverBasedHeuristic | |
| MilpRounding | |
| PumpForMinlp | |
| AmplInterface | Class for providing an Osi interface to Ipopt with an ampl nl file as input |
| AmplTMINLP | Ampl MINLP Interface |
| SolReader | A class for reading a .col or .row file containing name for variables and constraints (usually ampl generated file) |
| AuxInfo | Bonmin class for passing info between components of branch-and-cuts |
| BoundsReader | Reads a file containing change bounds for variables |
| BranchingTQP | This is an adapter class that converts a TMINLP2TNLP object into a TNLP, which is now just a QP |
| NamesReader | A class for reading a .col or .row file containing name for variables and constraints (usually ampl generated file) |
| CurvatureEstimator | |
| CutStrengthener | Class for strengthening OA cuts, and generating additional ones |
| OsiTMINLPInterface | 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) |
| RegisteredOptions | Class to add a few more information to Ipopt::RegisteredOptions |
| StartPointReader | This class reads a file with a starting point for Ipopt initalization |
| StrongBranchingSolver | This class is the base class for a solver that can be used in BonOsiSolverInterface to perform the strong branching solves |
| TMINLP | Base class for all MINLPs that use a standard triplet matrix form and dense vectors |
| TMINLP2OsiLP | A transformer class to build outer approximations i.e |
| TMINLP2TNLP | This is an adapter class that converts a TMINLP to a TNLP to be solved by Ipopt |
| TNLP2FPNLP | This is an adapter class to convert an NLP to a Feasibility Pump NLP by changing the objective function to the (2-norm) distance to a point |
| TNLPSolver | This is a generic class for calling an NLP solver to solve a TNLP |
| vector | A small wrap around std::vector to give easy access to array for interfacing with fortran code |
| SimpleReferenced | |
| SimpleReferencedPtr | |
| BqpdSolver | |
| BqpdWarmStart | Warm start for filter interface |
| FilterSolver | |
| FilterWarmStart | Warm start for filter interface |
| FilterWarmStartDiff | |
| IpoptInteriorWarmStarter | |
| IpoptSolver | |
| IpoptWarmStart | Class for storing warm start informations for Ipopt |
 IpoptWarmStartDiff | Diff class for IpoptWarmStart |
| FilterTypes | |
| Ipopt | |
| BonRandomChoice | |
| MyTMINLP | A C++ example for interfacing an MINLP with bonmin |
a concave function 