| blockStruct | |
| CbcOrClpParam | Very simple class for setting parameters |
| ClpCholeskyBase | Base class for Clp Cholesky factorization Will do better factorization |
| ClpCholeskyDense | |
| ClpCholeskyDenseC | |
| ClpCholeskyMumps | Mumps class for Clp Cholesky factorization |
| ClpCholeskyTaucs | Taucs class for Clp Cholesky factorization |
| ClpCholeskyUfl | Ufl class for Clp Cholesky factorization |
| ClpCholeskyWssmp | Wssmp class for Clp Cholesky factorization |
| ClpCholeskyWssmpKKT | WssmpKKT class for Clp Cholesky factorization |
| ClpConstraint | Constraint Abstract Base Class |
| ClpConstraintLinear | Linear Constraint Class |
| ClpConstraintQuadratic | Quadratic Constraint Class |
| ClpDataSave | This is a tiny class where data can be saved round calls |
| ClpDisasterHandler | Base class for Clp disaster handling |
| ClpDualRowDantzig | Dual Row Pivot Dantzig Algorithm Class |
| ClpDualRowPivot | Dual Row Pivot Abstract Base Class |
| ClpDualRowSteepest | Dual Row Pivot Steepest Edge Algorithm Class |
| ClpDummyMatrix | This implements a dummy matrix as derived from ClpMatrixBase |
| ClpDynamicExampleMatrix | This implements a dynamic matrix when we have a limit on the number of "interesting rows" |
| ClpDynamicMatrix | This implements a dynamic matrix when we have a limit on the number of "interesting rows" |
| ClpEventHandler | Base class for Clp event handling |
| ClpFactorization | This just implements CoinFactorization when an ClpMatrixBase object is passed |
| ClpGubDynamicMatrix | This implements Gub rows plus a ClpPackedMatrix |
| ClpGubMatrix | This implements Gub rows plus a ClpPackedMatrix |
| ClpHashValue | |
| ClpHashValue::CoinHashLink | Data |
| ClpInterior | This solves LPs using interior point methods |
| ClpLinearObjective | Linear Objective Class |
| ClpLsqr | This class implements LSQR |
| ClpMatrixBase | Abstract base class for Clp Matrices |
| ClpMessage | This deals with Clp messages (as against Osi messages etc) |
| ClpModel | |
| ClpNetworkBasis | This deals with Factorization and Updates for network structures |
| ClpNetworkMatrix | This implements a simple network matrix as derived from ClpMatrixBase |
| ClpNode | |
| ClpNode::branchState | |
| ClpNodeStuff | |
| ClpNonLinearCost | |
| ClpObjective | Objective Abstract Base Class |
| ClpPackedMatrix | |
| ClpPackedMatrix2 | |
| ClpPackedMatrix3 | |
| ClpPdco | This solves problems in Primal Dual Convex Optimization |
| ClpPdcoBase | Abstract base class for tailoring everything for Pcdo |
| ClpPlusMinusOneMatrix | This implements a simple +- one matrix as derived from ClpMatrixBase |
| ClpPredictorCorrector | This solves LPs using the predictor-corrector method due to Mehrotra |
| ClpPresolve | This is the Clp interface to CoinPresolve |
| ClpPrimalColumnDantzig | Primal Column Pivot Dantzig Algorithm Class |
| ClpPrimalColumnPivot | Primal Column Pivot Abstract Base Class |
| ClpPrimalColumnSteepest | Primal Column Pivot Steepest Edge Algorithm Class |
| ClpPrimalQuadraticDantzig | Primal Column Pivot Dantzig Algorithm Class |
| ClpQuadraticObjective | Quadratic Objective Class |
| ClpSimplex | This solves LPs using the simplex method |
| ClpSimplexDual | This solves LPs using the dual simplex method |
| ClpSimplexNonlinear | This solves non-linear LPs using the primal simplex method |
| ClpSimplexOther | This is for Simplex stuff which is neither dual nor primal |
| ClpSimplexPrimal | This solves LPs using the primal simplex method |
| ClpSimplexProgress | For saving extra information to see if looping |
| ClpSolve | This is a very simple class to guide algorithms |
| ClpTrustedData | For a structure to be used by trusted code |
| CoinLpIO::CoinHashLink | |
| CoinMpsIO::CoinHashLink | |
| CoinSnapshot::coinOwned | To say whether arrays etc are owned by CoinSnapshot |
| do_tighten_action::action | |
| doubleton_action::action | |
| drop_empty_cols_action::action | |
| drop_empty_rows_action::action | |
| dupcol_action::action | |
| duprow_action::action | |
| forcing_constraint_action::action | |
| gubrow_action::action | |
| Idiot | This class implements a very silly algorithm |
| IdiotResult | For use internally |
| implied_free_action::action | |
| Info | ******** DATA to be moved into protected section of ClpInterior |
| make_fixed_action::action | Structure to preserve the bound overwritten when fixing a variable |
| MyEventHandler | This is so user can trap events and do useful stuff |
| MyMessageHandler | |
| myPdco | This implements a simple network matrix as derived from ClpMatrixBase |
| Options | ******** DATA to be moved into protected section of ClpInterior |
| OsiClpDisasterHandler | |
| OsiClpSolverInterface | Clp Solver Interface |
| OsiCuts::const_iterator | Const Iterator |
| OsiCuts::iterator | Iterator |
| OsiCuts::OsiCutCompare | |
| OsiSolverInterface::ApplyCutsReturnCode | Internal class for obtaining status from the applyCuts method |
| OsiTestSolverInterface | Vol(ume) Solver Interface |
| OsiTestSolverInterface::OsiVolMatrixOneMinusOne_ | |
| Outfo | ******** DATA to be moved into protected section of ClpInterior |
| Coin::ReferencedObject | ReferencedObject class |
| remove_fixed_action::action | Structure to hold information necessary to reintroduce a column into the problem representation |
| slack_doubleton_action::action | |
| slack_singleton_action::action | |
| Coin::SmartPtr< T > | Template class for Smart Pointers |
| subst_constraint_action::action | |
| OsiUnitTest::TestOutcome | |
| OsiUnitTest::TestOutcomes | |
| tripleton_action::action | |
| useless_constraint_action::action | |
| VOL_alpha_factor | |
| VOL_dual | |
| VOL_dvector | Vector of doubles |
| VOL_indc | |
| VOL_ivector | Vector of ints |
| VOL_parms | This class contains the parameters controlling the Volume Algorithm |
| VOL_primal | |
| VOL_problem | This class holds every data for the Volume Algorithm and its solve method must be invoked to solve the problem |
| VOL_swing | |
| VOL_user_hooks | The user hooks should be overridden by the user to provide the problem specific routines for the volume algorithm |
| VOL_vh |
1.4.7