 _clique_options | |
 _EKKfactinfo | |
 _graph_t | |
 _NODE | |
 AbcBranchDecision | Abstract branching decision base class |
  AbcBranchDefaultDecision | Branching decision default class |
  AbcBranchDefaultDecision | Branching decision default class |
 AbcCutGenerator | Interface between Abc and Cut Generation Library |
 AbcDualRowPivot | Dual Row Pivot Abstract Base Class |
  AbcDualRowDantzig | Dual Row Pivot Dantzig Algorithm Class |
  AbcDualRowSteepest | Dual Row Pivot Steepest Edge Algorithm Class |
 AbcHeuristic | Heuristic base class |
  AbcRounding | Rounding class |
  AbcRounding | Rounding class |
 AbcMatrix | |
 AbcMatrix2 | |
 AbcMatrix3 | |
 AbcNonLinearCost | |
 AbcPrimalColumnPivot | Primal Column Pivot Abstract Base Class |
  AbcPrimalColumnDantzig | Primal Column Pivot Dantzig Algorithm Class |
  AbcPrimalColumnSteepest | Primal Column Pivot Steepest Edge Algorithm Class |
 AbcPseudocost | |
 AbcSimplexFactorization | This just implements AbcFactorization when an AbcMatrix object is passed |
 AbcTolerancesEtc | |
 AbcWarmStartOrganizer | |
 doubleton_action::action | |
 remove_dual_action::action | Postsolve (bound restore) instruction |
 dupcol_action::action | |
 duprow_action::action | |
 duprow3_action::action | |
 gubrow_action::action | |
 twoxtwo_action::action | |
 drop_empty_cols_action::action | |
 drop_empty_rows_action::action | |
 remove_fixed_action::action | Structure to hold information necessary to reintroduce a column into the problem representation |
 make_fixed_action::action | Structure to preserve the bound overwritten when fixing a variable |
 forcing_constraint_action::action | |
 implied_free_action::action | |
 slack_doubleton_action::action | |
 slack_singleton_action::action | |
 subst_constraint_action::action | |
 do_tighten_action::action | |
 tripleton_action::action | |
 useless_constraint_action::action | |
 ADJ_LIST | |
 allinfo | |
 ALPS_PS_STATS | |
 AlpsDecompParam | Parameters passed through to Alps |
 AlpsEncoded | This data structure is to contain the packed form of an encodable knowledge |
 AlpsKnowledge | The abstract base class of any user-defined class that Alps has to know about in order to encode/decode |
  AlpsModel | |
   AbcModel | Model class for ALPS Branch and Cut |
   AbcModel | Model class for ALPS Branch and Cut |
   AlpsDecompModel | Derivation of AlpsModel for DECOMP |
   KnapModel | |
  AlpsSolution | |
   AbcSolution | This class holds a MIP feasible primal solution |
   AbcSolution | This class holds a MIP feasible primal solution |
   AlpsDecompSolution | |
   BcpsDecompSolution | This class holds a MIP feasible primal solution |
   KnapSolution | |
  AlpsSubTree | This class contains the data pertaining to a particular subtree in the search tree |
  AlpsTreeNode | This class holds one node of the search tree |
   AbcTreeNode | |
   AbcTreeNode | |
   AlpsDecompTreeNode | |
   KnapTreeNode | |
 AlpsKnowledgeBroker | The base class of knowledge broker class |
  AlpsKnowledgeBrokerMPI | |
  AlpsKnowledgeBrokerSerial | |
 AlpsKnowledgePool | |
  AlpsNodePool | Node pool is used to store the nodes to be processed |
  AlpsSolutionPool | In the solution pool we assume that the lower the priority value the more desirable the solution is |
  AlpsSubTreePool | The subtree pool is used to store subtrees |
 AlpsNodeDesc | A class to refer to the description of a search tree node |
  AbcNodeDesc | |
  AbcNodeDesc | |
  AlpsDecompNodeDesc | Derivation of AlpsNodeDesc for DECOMP |
  KnapNodeDesc | |
 AlpsParameter | This parameter indeintifies a single parameter entry |
 AlpsParameterSet | This is the class serves as a holder for a set of parameters |
  AbcParams | |
  AbcParams | |
  AlpsParams | |
  KnapParams | |
 AlpsPriorityQueue< T > | |
 AlpsPriorityQueue< AlpsSubTree * > | |
 AlpsPriorityQueue< AlpsTreeNode * > | |
 AlpsSearchStrategy | |
  AlpsNodeSelection | |
   AlpsNodeSelectionBest | |
   AlpsNodeSelectionBreadth | |
   AlpsNodeSelectionDepth | |
   AlpsNodeSelectionEstimate | |
   AlpsNodeSelectionHybrid | |
  AlpsTreeSelection | |
   AlpsTreeSelectionBest | |
   AlpsTreeSelectionBreadth | |
   AlpsTreeSelectionDepth | |
   AlpsTreeSelectionEstimate | |
 AlpsStrLess | A function object to perform lexicographic lexicographic comparison between two C style strings |
 AlpsTimer | |
 ampl_info | |
 AP3_DecompParam | |
 AP3_Instance | |
 OsiSolverInterface::ApplyCutsReturnCode | Internal class for obtaining status from the applyCuts method |
 MCF_Instance::arc | MCF_Instance problem instance data |
 SDPUC_Instance::arc | SDPUC_Instance problem instance data |
 ARRAY_DESC | |
 ATM_Instance | |
 ATM_Param | |
 auxiliary_graph | |
 CbcGenCtlBlk::babState_struct | State of branch-and-cut |
 BASE_DESC | |
 BASIS_DESC | |
 BC_NODE | |
 BcpsModel | |
  BcpsDecompModel | |
 BcpsNodeDesc | |
  BcpsDecompNodeDesc | |
 BcpsTreeNode | |
  BcpsDecompTreeNode | |
 BEST_TOURS | |
 BitVector128 | |
 blockStruct | |
 blockStruct3 | |
 OsiLinkedBound::boundElementAction | |
 BOUNDS_CHANGE_DESC | |
 BRANCH_DESC | |
 BRANCH_OBJ | |
 ClpNode::branchState | |
 BUF_FIFO | |
 CglLandP::CachedData | Some informations that will be changed by the pivots and that we want to keep |
 CbcBaseModel | Base model |
 CbcBranchDecision | |
  CbcBranchDefaultDecision | Branching decision default class |
  CbcBranchDynamicDecision | Branching decision dynamic class |
  CbcBranchUserDecision | Branching decision user class |
 CbcCompare | |
 CbcCompareBase | |
  CbcCompareDefault | |
  CbcCompareDepth | |
  CbcCompareEstimate | |
  CbcCompareObjective | |
  CbcCompareUser | |
 CbcConsequence | Abstract base class for consequent bounds |
  CbcFixVariable | Class for consequent bounds |
 CbcCutGenerator | Interface between Cbc and Cut Generation Library |
 CbcCutModifier | Abstract cut modifier base class |
  CbcCutSubsetModifier | Simple cut modifier base class |
 CbcEventHandler | Base class for Cbc event handling |
 CbcFathom | Fathom base class |
  CbcFathomDynamicProgramming | FathomDynamicProgramming class |
 CbcFeasibilityBase | |
 CbcGenCtlBlk | |
 CbcHeuristic | Heuristic base class |
  CbcHeuristicCrossover | Crossover Search class |
  CbcHeuristicDINS | |
  CbcHeuristicDive | Dive class |
   CbcHeuristicDiveCoefficient | DiveCoefficient class |
   CbcHeuristicDiveFractional | DiveFractional class |
   CbcHeuristicDiveGuided | DiveGuided class |
   CbcHeuristicDiveLineSearch | DiveLineSearch class |
   CbcHeuristicDivePseudoCost | DivePseudoCost class |
   CbcHeuristicDiveVectorLength | DiveVectorLength class |
  CbcHeuristicDW | This is unlike the other heuristics in that it is very very compute intensive |
  CbcHeuristicDynamic3 | Heuristic - just picks up any good solution |
  CbcHeuristicFPump | Feasibility Pump class |
  CbcHeuristicGreedyCover | Greedy heuristic classes |
  CbcHeuristicGreedyEquality | |
  CbcHeuristicGreedySOS | Greedy heuristic for SOS and L rows (and positive elements) |
  CbcHeuristicJustOne | Just One class - this chooses one at random |
  CbcHeuristicLocal | LocalSearch class |
  CbcHeuristicNaive | Naive class a) Fix all ints as close to zero as possible b) Fix all ints with nonzero costs and < large to zero c) Put bounds round continuous and UIs and maximize |
  CbcHeuristicPartial | Partial solution class If user knows a partial solution this tries to get an integer solution it uses hotstart information |
  CbcHeuristicPivotAndFix | LocalSearch class |
  CbcHeuristicProximity | |
  CbcHeuristicRandRound | LocalSearch class |
  CbcHeuristicRENS | LocalSearch class |
  CbcHeuristicRINS | LocalSearch class |
  CbcHeuristicVND | LocalSearch class |
  CbcRounding | Rounding class |
  CbcSerendipity | Heuristic - just picks up any good solution found by solver - see OsiBabSolver |
 CbcHeuristicNode | A class describing the branching decisions that were made to get to the node where a heuristic was invoked from |
 CbcHeuristicNodeList | |
 CbcModel | Simple Branch and bound class |
 CbcNauty | |
 CbcNodeInfo | Information required to recreate the subproblem at this node |
  CbcFullNodeInfo | Information required to recreate the subproblem at this node |
  CbcPartialNodeInfo | Holds information for recreating a subproblem by incremental change from the parent |
 CbcObjectUpdateData | |
 CbcOrClpParam | Very simple class for setting parameters |
 CbcParam | Very simple class for setting parameters |
 CbcGenCtlBlk::cbcParamsInfo_struct | Start and end of CbcModel parameters in parameter vector |
 CbcRowCuts | |
 CbcSolver | This allows the use of the standalone solver in a flexible manner |
 CbcSolverUsefulData | The CbcSolver class was taken out at a 9/12/09 meeting This is a feeble replacement |
 CbcSolverUsefulData2 | Structure to hold useful arrays |
 CbcStatistics | For gathering statistics |
 CbcStopNow | Support the use of a call back class to decide whether to stop |
 CbcStrategy | Strategy base class |
  CbcStrategyDefault | Default class |
  CbcStrategyDefaultSubTree | Default class for sub trees |
  CbcStrategyNull | Null class |
 CbcStrongInfo | Abstract base class for `objects' |
 CbcSymmetry | Class to deal with symmetry |
 CbcThread | A class to encapsulate thread stuff |
 CbcTree | Using MS heap implementation |
  CbcTreeLocal | |
  CbcTreeVariable | |
 CbcUser | A class to allow the use of unknown user functionality |
 CCdata_rhvector | |
 CCdata_user | |
 CCdatagroup | |
 CCrandstate | |
 CCtsp_lpclique | |
 CCtsp_lpcut_in | |
 CCtsp_segment | |
 CCtsp_skeleton | |
 CG_CNRP_SPEC | |
 CG_PARAMS | |
 CG_PROB | |
 CG_USER_PARAMS | |
 Cgl012Cut | 012Cut Generator Class |
 cgl_arc | |
 cgl_graph | |
 cgl_node | |
 CGL_PARAMS | |
 CglBK | For Bron-Kerbosch |
 CglCutGenerator | Cut Generator Base Class |
  CglAllDifferent | AllDifferent Cut Generator Class This has a number of sets |
  CglClique | |
   CglFakeClique | |
  CglDuplicateRow | DuplicateRow Cut Generator Class |
  CglFlowCover | Lifed Simple Generalized Flow Cover Cut Generator Class |
  CglGMI | Gomory cut generator with several cleaning procedures, used to test the numerical safety of the resulting cuts |
  CglGomory | Gomory Cut Generator Class |
  CglImplication | This just uses implication info |
  CglKnapsackCover | Knapsack Cover Cut Generator Class |
  CglLandP | |
  CglLiftAndProject | Lift And Project Cut Generator Class |
  CglMixedIntegerRounding | Mixed Integer Rounding Cut Generator Class |
  CglMixedIntegerRounding2 | Mixed Integer Rounding Cut Generator Class |
  CglOddHole | Odd Hole Cut Generator Class |
  CglProbing | Probing Cut Generator Class |
  CglRedSplit | Gomory Reduce-and-Split Cut Generator Class; See method generateCuts() |
  CglRedSplit2 | Reduce-and-Split Cut Generator Class; See method generateCuts() |
  CglResidualCapacity | Residual Capacity Inequalities Cut Generator Class |
  CglSimpleRounding | Simple Rounding Cut Generator Class |
  CglStored | Stored Cut Generator Class |
   CglTemporary | Stored Temporary Cut Generator Class - destroyed after first use |
  CglTwomir | Twostep MIR Cut Generator Class |
  CglZeroHalf | Zero Half Cut Generator Class |
 CglFlowVUB | Variable upper bound class |
 CglHashLink | Only store unique row cuts |
 LAP::CglLandPSimplex | |
 CglMixIntRoundVUB | |
 CglMixIntRoundVUB2 | |
 CglParam | Class collecting parameters for all cut generators |
  CglGMIParam | Class collecting parameters for the GMI cut generator |
  CglLandP::Parameters | Class storing parameters |
  CglRedSplit2Param | Class collecting parameters the Reduced-and-split cut generator |
  CglRedSplitParam | Class collecting parameters the Reduced-and-split cut generator |
 CglPreProcess | Class for preProcessing and postProcessing |
 CglTreeInfo | Information about where the cut generator is invoked from |
  CglTreeProbingInfo | |
 CglUniqueRowCuts | |
 CbcGenCtlBlk::chooseStrongCtl_struct | Control variables for a strong branching method |
 CbcGenCtlBlk::cliqueCtl_struct | Control variable and prototype for clique cut generator |
 CliqueEntry | Derived class to pick up probing info |
 CglProbing::CliqueType | Clique type |
 CglKnapsackCover::CliqueType | Clique type |
 CLOSENODE | |
 ClpCholeskyBase | Base class for Clp Cholesky factorization Will do better factorization |
  ClpCholeskyDense | |
  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 |
 ClpCholeskyDenseC | |
 ClpConstraint | Constraint Abstract Base Class |
  ClpConstraintAmpl | Ampl Constraint 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 |
  OsiClpDisasterHandler | |
 ClpDualRowPivot | Dual Row Pivot Abstract Base Class |
  ClpDualRowDantzig | Dual Row Pivot Dantzig Algorithm Class |
   ClpPEDualRowDantzig | |
  ClpDualRowSteepest | Dual Row Pivot Steepest Edge Algorithm Class |
   ClpPEDualRowSteepest | Dual Row Pivot Steepest Edge Algorithm Class |
 ClpEventHandler | Base class for Clp event handling |
  MyEventHandler | This is so user can trap events and do useful stuff |
 ClpFactorization | This just implements CoinFactorization when an ClpMatrixBase object is passed |
 ClpHashValue | |
 ClpLsqr | This class implements LSQR |
 ClpMatrixBase | Abstract base class for Clp Matrices |
  ClpDummyMatrix | This implements a dummy matrix as derived from ClpMatrixBase |
  ClpNetworkMatrix | This implements a simple network matrix as derived from ClpMatrixBase |
  ClpPackedMatrix | |
   ClpDynamicMatrix | This implements a dynamic matrix when we have a limit on the number of "interesting rows" |
    ClpDynamicExampleMatrix | This implements a dynamic matrix when we have a limit on the number of "interesting rows" |
   ClpGubMatrix | This implements Gub rows plus a ClpPackedMatrix |
    ClpGubDynamicMatrix | This implements Gub rows plus a ClpPackedMatrix |
  ClpPlusMinusOneMatrix | This implements a simple +- one matrix as derived from ClpMatrixBase |
 ClpModel | |
  ClpInterior | This solves LPs using interior point methods |
   ClpPdco | This solves problems in Primal Dual Convex Optimization |
   ClpPredictorCorrector | This solves LPs using the predictor-corrector method due to Mehrotra |
  ClpSimplex | This solves LPs using the simplex method |
   AbcSimplex | |
    AbcSimplexDual | This solves LPs using the dual simplex method |
    AbcSimplexPrimal | This solves LPs using the primal simplex method |
   ClpSimplexDual | This solves LPs using the dual simplex method |
   ClpSimplexOther | This is for Simplex stuff which is neither dual nor primal |
   ClpSimplexPrimal | This solves LPs using the primal simplex method |
    ClpSimplexNonlinear | This solves non-linear LPs using the primal simplex method |
 ClpNetworkBasis | This deals with Factorization and Updates for network structures |
 ClpNode | |
 ClpNodeStuff | |
 ClpNonLinearCost | |
 ClpObjective | Objective Abstract Base Class |
  ClpAmplObjective | Ampl Objective Class |
  ClpLinearObjective | Linear Objective Class |
  ClpQuadraticObjective | Quadratic Objective Class |
 ClpPackedMatrix2 | |
 ClpPackedMatrix3 | |
 ClpPdcoBase | Abstract base class for tailoring everything for Pcdo |
  myPdco | This implements a simple network matrix as derived from ClpMatrixBase |
 ClpPESimplex | BASE CLASS FOR THE IMPROVED SIMPLEX |
 ClpPresolve | This is the Clp interface to CoinPresolve |
 ClpPrimalColumnPivot | Primal Column Pivot Abstract Base Class |
  ClpPrimalColumnDantzig | Primal Column Pivot Dantzig Algorithm Class |
   ClpPEPrimalColumnDantzig | |
  ClpPrimalColumnSteepest | Primal Column Pivot Steepest Edge Algorithm Class |
   ClpPEPrimalColumnSteepest | Primal Column Pivot Steepest Edge Algorithm Class |
  ClpPrimalQuadraticDantzig | Primal Column Pivot Dantzig Algorithm Class |
 ClpSimplexProgress | For saving extra information to see if looping |
 ClpSolve | This is a very simple class to guide algorithms |
 clpTempInfo | |
 ClpTrustedData | For a structure to be used by trusted code |
 CNRP_DG | |
 CNRP_LP_PARAMS | |
 CNRP_PARAMS | |
 CNRP_PROBLEM | |
 CNRP_SPEC | |
 CNRP_SPEC_CP | |
 CoinAbcAnyFactorization | Abstract base class which also has some scalars so can be used from Dense or Simp |
  CoinAbcDenseFactorization | This deals with Factorization and Updates This is a simple dense version so other people can write a better one |
  CoinAbcTypeFactorization | |
 CoinAbcStack | |
 CoinAbcStatistics | |
 CoinAbsFltEq | Equality to an absolute tolerance |
 CoinArrayWithLength | Pointer with length in bytes |
  CoinArbitraryArrayWithLength | Arbitrary version |
  CoinBigIndexArrayWithLength | CoinBigIndex * version |
  CoinDoubleArrayWithLength | Double * version |
  CoinFactorizationDoubleArrayWithLength | CoinFactorizationDouble * version |
  CoinFactorizationLongDoubleArrayWithLength | CoinFactorizationLongDouble * version |
  CoinIntArrayWithLength | Int * version |
  CoinUnsignedIntArrayWithLength | Unsigned int * version |
  CoinVoidStarArrayWithLength | Void * version |
 CoinBaseModel | |
  CoinModel | This is a simple minded model which is stored in a format which makes it easier to construct and modify but not efficient for algorithms |
  CoinStructuredModel | |
 CoinBuild | In many cases it is natural to build a model by adding one row at a time |
 CoinDenseVector< T > | Dense Vector |
 CoinError | Error Class thrown by an exception |
  CglLandP::NoBasisError | |
  CglLandP::SimplexInterfaceError | |
 CoinExternalVectorFirstGreater_2< S, T, V > | Function operator |
 CoinExternalVectorFirstGreater_3< S, T, U, V > | Function operator |
 CoinExternalVectorFirstLess_2< S, T, V > | Function operator |
 CoinExternalVectorFirstLess_3< S, T, U, V > | Function operator |
 CoinFactorization | This deals with Factorization and Updates |
 CoinFileIOBase | Base class for FileIO classes |
  CoinFileInput | Abstract base class for file input classes |
   CoinPlainFileInput | This reads plain text files |
  CoinFileOutput | Abstract base class for file output classes |
 CoinFirstAbsGreater_2< S, T > | Function operator |
 CoinFirstAbsGreater_3< S, T, U > | Function operator |
 CoinFirstAbsLess_2< S, T > | Function operator |
 CoinFirstAbsLess_3< S, T, U > | Function operator |
 CoinFirstGreater_2< S, T > | Function operator |
 CoinFirstGreater_3< S, T, U > | Function operator |
 CoinFirstLess_2< S, T > | Function operator |
 CoinFirstLess_3< S, T, U > | Function operator |
 ClpHashValue::CoinHashLink | Data |
 CoinHashLink | Really for Conflict cuts to - a) stop duplicates b) allow half baked cuts The whichRow_ field in OsiRowCut2 is used for a type 0 - normal 1 - processed cut (conflict) 2 - unprocessed cut i.e |
 CoinLpIO::CoinHashLink | |
 CoinMpsIO::CoinHashLink | |
 CoinIndexedVector | Indexed Vector |
  CoinPartitionedVector | |
  LAP::TabRow | |
 CoinLpIO | Class to read and write Lp files |
 CoinMessageHandler | Base class for message handling |
  MyMessageHandler | |
 CoinMessages | Class to hold and manipulate an array of massaged messages |
  AbcMessage | |
  AbcMessage | |
  AlpsMessage | |
  CbcMessage | |
  CglMessage | This deals with Cgl messages (as against Osi messages etc) |
  ClpMessage | This deals with Clp messages (as against Osi messages etc) |
  CoinMessage | The standard set of Coin messages |
  LAP::LandPMessages | Message handler for lift-and-project simplex |
  LAP::LapMessages | Output messages for Cgl |
 CoinModelHash | |
 CoinModelHash2 | For int,int hashing |
 CoinModelHashLink | For names and hashing |
 CoinModelHashLink2 | |
 CoinModelInfo2 | This is a model which is made up of Coin(Structured)Model blocks |
 CoinModelLink | This is for various structures/classes needed by CoinModel |
 CoinModelLinkedList | |
 CoinModelTriple | For linked lists |
 CoinMpsCardReader | Very simple code for reading MPS data |
 CoinMpsIO | MPS IO Interface |
 CoinOneMessage | Class for one massaged message |
 CoinOtherFactorization | Abstract base class which also has some scalars so can be used from Dense or Simp |
  CoinDenseFactorization | This deals with Factorization and Updates This is a simple dense version so other people can write a better one |
  CoinOslFactorization | |
  CoinSimpFactorization | |
 CoinSnapshot::coinOwned | To say whether arrays etc are owned by CoinSnapshot |
 CoinPackedMatrix | Sparse Matrix Base Class |
 CoinPackedVectorBase | Abstract base class for various sparse vectors |
  CoinPackedVector | Sparse Vector |
  CoinShallowPackedVector | Shallow Sparse Vector |
 CoinPair< S, T > | An ordered pair |
 CoinParam | A base class for `keyword value' command line parameters |
  CbcCbcParam | Class for control parameters that act on a CbcModel object |
  CbcGenParam | Class for cbc-generic control parameters |
  CbcOsiParam | Class for control parameters that act on a OsiSolverInterface object |
 CoinPrePostsolveMatrix | Collects all the information about the problem that is needed in both presolve and postsolve |
  CoinPostsolveMatrix | Augments CoinPrePostsolveMatrix with information about the problem that is only needed during postsolve |
  CoinPresolveMatrix | Augments CoinPrePostsolveMatrix with information about the problem that is only needed during presolve |
 CoinPresolveAction | Abstract base class of all presolve routines |
  do_tighten_action | |
  doubleton_action | Solve ax+by=c for y and substitute y out of the problem |
  drop_empty_cols_action | Physically removes empty columns in presolve, and reinserts empty columns in postsolve |
  drop_empty_rows_action | Physically removes empty rows in presolve, and reinserts empty rows in postsolve |
  drop_zero_coefficients_action | Removal of explicit zeros |
  dupcol_action | Detect and remove duplicate columns |
  duprow3_action | |
  duprow_action | Detect and remove duplicate rows |
  forcing_constraint_action | Detect and process forcing constraints and useless constraints |
  gubrow_action | Detect and remove entries whose sum is known |
  implied_free_action | Detect and process implied free variables |
  isolated_constraint_action | |
  make_fixed_action | Fix a variable at a specified bound |
  remove_dual_action | Attempt to fix variables by bounding reduced costs |
  remove_fixed_action | Excise fixed variables from the model |
  slack_doubleton_action | Convert an explicit bound constraint to a column bound |
  slack_singleton_action | For variables with one entry |
  subst_constraint_action | Detect and process implied free variables |
  tripleton_action | We are only going to do this if it does not increase number of elements? |
  twoxtwo_action | Detect interesting 2 by 2 blocks |
  useless_constraint_action | |
 CoinPresolveMonitor | Monitor a row or column for modification |
 CoinRational | |
 CoinRelFltEq | Equality to a scaled tolerance |
 CoinSearchTreeBase | |
  CoinSearchTree< Comp > | |
 CoinSearchTreeCompareBest | Best first search |
 CoinSearchTreeCompareBreadth | |
 CoinSearchTreeCompareDepth | Depth First Search |
 CoinSearchTreeComparePreferred | Function objects to compare search tree nodes |
 CoinSearchTreeManager | |
 CoinSet | Very simple class for containing data on set |
  CoinSosSet | Very simple class for containing SOS set |
 CoinSnapshot | NON Abstract Base Class for interfacing with cut generators or branching code or |
 CoinThreadRandom | Class for thread specific random numbers |
 CoinTimer | This class implements a timer that also implements a tracing functionality |
 CoinTreeNode | A class from which the real tree nodes should be derived from |
  CbcNode | Information required while the node is live |
 CoinTreeSiblings | |
 CoinTriple< S, T, U > | |
 CoinWarmStart | Abstract base class for warm start information |
  CoinWarmStartBasis | The default COIN simplex (basis-oriented) warm start class |
   AbcWarmStart | |
  CoinWarmStartDual | WarmStart information that is only a dual vector |
  CoinWarmStartPrimalDual | WarmStart information that is only a dual vector |
  CoinWarmStartVector< T > | WarmStart information that is only a vector |
  CoinWarmStartVector< double > | |
  CoinWarmStartVector< U > | |
  CoinWarmStartVectorPair< T, U > | |
  SymWarmStart | |
 CoinWarmStartDiff | Abstract base class for warm start `diff' objects |
  CoinWarmStartBasisDiff | A `diff' between two CoinWarmStartBasis objects |
  CoinWarmStartDualDiff | A `diff' between two CoinWarmStartDual objects |
  CoinWarmStartPrimalDualDiff | A `diff' between two CoinWarmStartPrimalDual objects |
  CoinWarmStartVectorDiff< T > | A `diff' between two CoinWarmStartVector objects |
  CoinWarmStartVectorDiff< double > | |
  CoinWarmStartVectorDiff< U > | |
  CoinWarmStartVectorPairDiff< T, U > | |
 CoinYacc | |
 COL_DATA | |
 COL_GEN_PARAMS | |
 COL_IMP | |
 COL_ORDERED | |
 COLINFO | |
 CbcGenCtlBlk::combineCtl_struct | Control variable and prototype for combine heuristic |
 MCF_Instance::commodity | |
 ConcordeGraph | |
 ConcordeSubtourCut | |
 OsiCuts::const_iterator | Const Iterator |
 CP_CUT_DATA | |
 CP_PARAMS | |
 CP_USER_PARAMS | |
 cut | |
 CUT_COLLECTION | |
 CUT_DATA | |
 cut_list | |
 CUT_POOL | |
 CUT_TIME_OUT | |
 cutParams | |
 LAP::Cuts | To store extra cuts generated by columns from which they origin |
 CVRPsep_LPSol | |
 cycle | |
 cycle_list | |
 DBL_EDGE_DATA | |
 DCMP_COL_SET | |
 DEBUGGING | |
 CbcGenCtlBlk::debugSolInfo_struct | Array of primal variable values for debugging |
 DecompAlgo | Base class for DECOMP algorithms |
  DecompAlgoC | Class for DECOMP algorithm Cutting Plane Method |
   DippyAlgoC | Python-enabled DecompAlgoC |
  DecompAlgoC | Class for DECOMP algorithm Cutting Plane Method |
  DecompAlgoD | Class for DECOMP algorithm Decomp |
  DecompAlgoPC | Class for DECOMP algorithm Price and Cut |
   DecompAlgoD | Class for DECOMP algorithm Decomp |
   DippyAlgoPC | Python-enabled DecompAlgoPC |
  DecompAlgoPC | Class for DECOMP algorithm Price and Cut |
  DecompAlgoRC | |
   DippyAlgoRC | Python-enabled DecompAlgoRC |
  DecompAlgoRC | |
 DecompAlgoCGL | An interface to CGL cut generator library |
 DecompApp | The main application class |
  AP3_DecompApp | |
  ATM_DecompApp | |
  DippyDecompApp | |
  GAP_DecompApp | |
  GAP_DecompApp | |
  MAD_DecompApp | |
  MCF_DecompApp | |
  MILP_DecompApp | |
  MILP_DecompApp | |
  MILPBlock_DecompApp | |
  MMKP_DecompApp | |
  SDPUC_DecompApp | |
  SmallIP_DecompApp | |
  SmallIP_DecompApp | |
  TSP_DecompApp | |
  VRP_DecompApp | |
 DecompConstraintSet | |
 DecompCut | |
  DecompCutOsi | |
  DecompCutOsi | |
  DippyDecompCut | |
  TSP_SubtourCut | |
  VRP_GSECCut | |
 DecompMainParam | |
 DecompMemPool | |
 DecompModel | |
  DecompSubModel | |
 DecompNodeStats | |
 DecompObjBound | |
 DecompParam | |
 DecompSolution | |
  MAD_DecompSolution | |
 DecompSolverResult | Storage of solver result |
 DecompStats | |
 DecompVar | |
 DecompWaitingCol | |
 DecompWaitingRow | |
 DeletePtrObject | |
 DG_EDGE | |
 DG_GRAPH | |
 DG_NET_EDGE | |
 DG_NET_ELIST | |
 DG_NET_NETWORK | |
 DG_NET_VERTEX | |
 DG_NODE | |
 DGG_constraint_t | |
 DGG_data_t | |
 DGG_list_t | |
 DippyAlgoMixin | Mixin class for Dip Algorithms |
  DippyAlgoC | Python-enabled DecompAlgoC |
  DippyAlgoPC | Python-enabled DecompAlgoPC |
  DippyAlgoRC | Python-enabled DecompAlgoRC |
 CglProbing::disaggregation_struct_tag | Disaggregation cuts and for building cliques |
 disaggregationAction | Only useful type of disaggregation is most normal For now just done for 0-1 variables Can be used for building cliques |
 DISTANCES | |
 CbcGenCtlBlk::djFixCtl_struct | Control use of reduced cost fixing prior to B&C |
 DOUBLE_ARRAY_DESC | |
 DRAW_GRAPH_PARAMS | |
 DRAW_GRAPH_PROBLEM | |
 dropped_zero | Tracking information for an explicit zero coefficient |
 dualColumnResult | |
 edge | |
 EDGE | |
 EDGE_DATA | |
 EKKHlink | This deals with Factorization and Updates This is ripped off from OSL!!!!!!!!! |
 ELIST | |
 EXEC | |
 FactorPointers | Pointers used during factorization |
 CbcGenCtlBlk::flowCtl_struct | Control variable and prototype for flow cover cut generator |
 FNODE | |
 CglClique::fnode | A node of the fractional graph |
 FP_DATA | |
 FP_VARS | |
 CbcGenCtlBlk::fpumpCtl_struct | Control variable and prototype for feasibility pump heuristic |
 CglClique::frac_graph | A graph corresponding to a fractional solution of an LP |
 FRAC_GRAPH | |
 GAP_DecompParam | |
 GAP_Instance | |
 GAP_KnapPisinger | Types and protos for combo algorithm API: |
 GAP_Knapsack | |
 CbcGenCtlBlk::genParamsInfo_struct | Start and end of cbc-generic parameters in parameter vector |
 glp_prob | |
 CbcGenCtlBlk::gomoryCtl_struct | Control variable and prototype for Gomory cut generator |
 CbcGenCtlBlk::greedyCoverCtl_struct | Control variable and prototype for greedy cover heuristic |
 CbcGenCtlBlk::greedyEqualityCtl_struct | Control variable and prototype for greedy equality heuristic |
 GreedyPoint | |
 HEUR_PARAMS | |
 HEUR_PROB | |
 Idiot | This class implements a very silly algorithm |
 IdiotResult | For use internally |
 ilp | |
 IMPLIST | |
 IMPVAR | |
 Info | ******** DATA to be moved into protected section of ClpInterior |
 info_weak | |
 is_greater_thanD | |
 is_less_thanD | |
 isetset | |
 itemrec | |
 itemset | |
 OsiCuts::iterator | Iterator |
 CbcGenCtlBlk::knapsackCtl_struct | Control variable and prototype for knapsack cover cut generator |
 LB_PARAMS | |
 LB_PROB | |
 CbcSymmetry::less_than_str | |
 LEVEL_GRAPH | |
 list | |
  OsiUnitTest::TestOutcomes | Utility class to maintain a list of test outcomes |
 CbcGenCtlBlk::localTreeCtl_struct | Control variables for local tree |
 log_var | |
 LP_NET | |
 LP_NET_EDGE | |
 LP_NET_NODE | |
 LP_PARAMS | |
 LP_PROB | |
 LP_SOL | |
 LP_STAT | |
 LPDATA | |
 MAD_Cliquer | |
 MAD_DecompParam | |
 MAD_MemPool | |
 MAD_Qualex | |
 MCF_DecompParam | |
 MCF_Instance | |
 MCF_Param | |
 MILP_Param | |
 MILPBlock_Param | |
 MIPDESC | |
 MIPINFO | |
 CbcGenCtlBlk::mirCtl_struct | Control variable and prototype for MIR cut generator |
 MMKP_DecompParam | |
 MMKP_Instance | |
 MMKP_MCKnap | |
 MMKP_MemPool | |
 MMKP_Model | |
 MMKP_Param | |
 MMKPModel | |
 MPP_PARAMETERS | |
 MPP_PROBLEM | |
 CbcSymmetry::myclass | |
 CbcSymmetry::myclass0 | |
 NEIGHBOR | |
 NETWORK | |
 SDPUC_Instance::node | |
 CbcSymmetry::Node | |
 NODE_DESC | |
 NODE_TIMES | |
 CbcGenCtlBlk::oddHoleCtl_struct | Control variable and prototype for odd hole cut generator |
 Options | ******** DATA to be moved into protected section of ClpInterior |
 ordintv | |
 ordrec | |
 ordstack | |
 OsiAuxInfo | This class allows for a more structured use of algorithmic tweaking to an OsiSolverInterface |
  OsiBabSolver | This class allows for the use of more exotic solvers e.g |
 OsiBranchingInformation | |
 OsiBranchingObject | Abstract branching object base class |
  CbcBranchingObject | Abstract branching object base class Now just difference with OsiBranchingObject |
   CbcCliqueBranchingObject | Branching object for unordered cliques |
   CbcCutBranchingObject | Cut branching object |
   CbcDummyBranchingObject | Dummy branching object |
   CbcFixingBranchingObject | General Branching Object class |
   CbcIntegerBranchingObject | Simple branching object for an integer variable |
    CbcDynamicPseudoCostBranchingObject | Simple branching object for an integer variable with pseudo costs |
    CbcIntegerPseudoCostBranchingObject | Simple branching object for an integer variable with pseudo costs |
   CbcLinkBranchingObject | Branching object for Special ordered sets |
   CbcLongCliqueBranchingObject | Unordered Clique Branching Object class |
   CbcLotsizeBranchingObject | Lotsize branching object |
   CbcNWayBranchingObject | N way branching Object class |
   CbcOrbitalBranchingObject | Branching object for Orbital branching |
   CbcSOSBranchingObject | Branching object for Special ordered sets |
  OsiTwoWayBranchingObject | This just adds two-wayness to a branching object |
   OsiBiLinearBranchingObject | Branching object for BiLinear objects |
   OsiIntegerBranchingObject | Simple branching object for an integer variable |
   OsiLinkBranchingObject | Branching object for Linked ordered sets |
   OsiLotsizeBranchingObject | Lotsize branching object |
   OsiSOSBranchingObject | Branching object for Special ordered sets |
    OsiOldLinkBranchingObject | Branching object for Linked ordered sets |
 OsiChooseVariable | This class chooses a variable to branch on |
  OsiChooseStrong | This class chooses a variable to branch on |
   OsiChooseStrongSubset | This class chooses a variable to branch on |
 OsiCut | |
  OsiColCut | Column Cut Class |
  OsiRowCut | Row Cut Class |
   CbcCountRowCut | OsiRowCut augmented with bookkeeping |
   OsiRowCut2 | Row Cut Class which refers back to row which created it |
 OsiCuts::OsiCutCompare | |
 OsiCuts | Collections of row cuts and column cuts |
 OsiData | Class collecting pointers on data for OsiEmpty |
 OsiHotInfo | This class contains the result of strong branching on a variable When created it stores enough information for strong branching |
 OsiLinkedBound | List of bounds which depend on other bounds |
 OsiObject | Abstract base class for `objects' |
  CbcObject | |
   CbcBranchCut | Define a cut branching class |
    CbcBranchAllDifferent | Define a branch class that branches so that it is only satsified if all members have different values So cut is x <= y-1 or x >= y+1 |
    CbcBranchToFixLots | Define a branch class that branches so that one way variables are fixed while the other way cuts off that solution |
   CbcClique | Branching object for cliques |
   CbcFollowOn | Define a follow on class |
   CbcFollowOn2 | Define a follow on class |
   CbcGeneral | Define a catch all class |
   CbcIdiotBranch | Define an idiotic idea class |
   CbcLink | Define Special Linked Ordered Sets |
   CbcLotsize | Lotsize class |
   CbcNWay | Define an n-way class for variables |
   CbcSimpleInteger | Define a single integer class |
    CbcSimpleIntegerDynamicPseudoCost | Define a single integer class but with dynamic pseudo costs |
    CbcSimpleIntegerFixed | Define a single integer class where branching is forced until fixed |
    CbcSimpleIntegerPseudoCost | Define a single integer class but with pseudo costs |
   CbcSOS | Branching object for Special Ordered Sets of type 1 and 2 |
  OsiObject2 | Define a class to add a bit of complexity to OsiObject This assumes 2 way branching |
   OsiBiLinear | Define BiLinear objects |
    OsiBiLinearEquality | Define Continuous BiLinear objects for an == bound |
   OsiLotsize | Lotsize class |
   OsiSimpleInteger | Define a single integer class |
    OsiSimpleFixedInteger | Define a single integer class - but one where you keep branching until fixed even if satisfied |
    OsiUsesBiLinear | Define a single variable class which is involved with OsiBiLinear objects |
   OsiSOS | Define Special Ordered Sets of type 1 and 2 |
    OsiLink | Define Special Linked Ordered Sets |
    OsiOldLink | |
 OsiOneLink | Define data for one link |
 CbcGenCtlBlk::osiParamsInfo_struct | Start and end of OsiSolverInterface parameters in parameter vector |
 OsiPresolve | OSI interface to COIN problem simplification capabilities |
 OsiPseudoCosts | This class is the placeholder for the pseudocosts used by OsiChooseStrong |
 OsiRowCutDebugger | Validate cuts against a known solution |
 OsiSolverBranch | Solver Branch Class |
 OsiSolverInterface | Abstract Base Class for describing an interface to a solver |
  OsiCbcSolverInterface | Cbc Solver Interface |
  OsiClpSolverInterface | Clp Solver Interface |
   CbcOsiSolver | This is for codes where solver needs to know about CbcModel Seems to provide only one value-added feature, a CbcModel object |
    OsiSolverLink | This is to allow the user to replace initialSolve and resolve This version changes coefficients |
   CbcSolver2 | This is to allow the user to replace initialSolve and resolve |
   CbcSolver3 | This is to allow the user to replace initialSolve and resolve |
   CbcSolverLongThin | This is to allow the user to replace initialSolve and resolve |
   ClpQuadInterface | This is to allow the user to replace initialSolve and resolve |
   OsiSolverLinearizedQuadratic | This is to allow the user to replace initialSolve and resolve |
  OsiCpxSolverInterface | CPLEX Solver Interface |
  OsiGlpkSolverInterface | |
  OsiGrbSolverInterface | Gurobi Solver Interface |
  OsiMskSolverInterface | |
  OsiNullSolverInterface | |
  OsiNullSolverInterface | |
  OsiSpxSolverInterface | SoPlex Solver Interface Instantiation of OsiSpxSolverInterface for SoPlex |
  OsiSymSolverInterface | OSI Solver Interface for SYMPHONY |
  OsiTestSolverInterface | Vol(ume) Solver Interface |
  OsiXprSolverInterface | XPRESS-MP Solver Interface |
 OsiSolverResult | Solver Result Class |
 OsiTestSolverInterface::OsiVolMatrixOneMinusOne_ | |
 OUR_COL_SET | |
 Outfo | ******** DATA to be moved into protected section of ClpInterior |
 ClpSimplexOther::parametricsData | |
 PARAMS | |
 parity_ilp | |
 partset | |
 partvect | |
 Perturb | |
 AbcSimplexPrimal::pivotStruct | |
 pool_cut | |
 pool_cut_list | |
 POOL_EDGE | |
 POOL_NET | |
 POOL_NODE | |
 POS_WEIGHT_LHS | |
 PREP_ENVIRONMENT | |
 PREP_PARAMS | |
 PREP_STATS | |
 PREPDesc | |
 presolvehlink | Links to aid in packed matrix modification |
 CbcHeuristicDive::PriorityType | Array of priorities |
 PROB_TIMES | |
 CbcGenCtlBlk::probingCtl_struct | Control variable and prototype for probing cut generator |
 PROBLEM_STAT | |
 PROCESS_SET | |
 PseudoReducedCost | |
 RC_DESC | |
 RC_DUP_DESC | |
 CbcGenCtlBlk::redSplitCtl_struct | Control variable and prototype for reduce-and-split cut generator |
 Coin::ReferencedObject | ReferencedObject class |
 CbcGenCtlBlk::roundingCtl_struct | Control variable and prototype for simple rounding heuristic |
 ROUTE_DATA | |
 ROW_DATA | |
 ROW_ORDERED | |
 ROWINFO | |
 SAVINGS_PARAM | |
 scatterStruct | |
 SDPUC_Instance | |
 SDPUC_Param | |
 select_cut | |
 separation_graph | |
 sg_label_writer< EdgeWeight > | |
 sg_label_writer_vertex | |
 short_path_node | |
 SILCEP_Instance | |
 SMALL_GRAPH | |
 Coin::SmartPtr< T > | Template class for Smart Pointers |
 SOL_POOL_PARAMS | |
 solrec | |
 solstruct | |
 SOR_IntDblArrT | |
 SOR_IntDblT | |
 SP_DESC | |
 SP_SOLUTION_DESC | |
 SPARSE_MATRIX | |
 SPP_CG_PARAMS | |
 SPP_CG_PROBLEM | |
 SPP_CG_TMP | |
 SPP_LP_PARAMS | |
 SPP_LP_PROBLEM | |
 SPP_LP_TMP | |
 SPP_PARAMETERS | |
 SPP_PROBLEM | |
 SRDESC | |
 STATISTICS | |
 STR_INT | |
 SWEEP_DATA | |
 SYM_ENVIRONMENT | |
 symrec | For string evaluation |
 TEMPORARY | |
 OsiUnitTest::TestOutcome | A single test outcome record |
 SDPUC_Instance::timeseries | |
 TM_PARAMS | |
 TM_PROB | |
 TM_TEMP | |
 TREE_NODE | |
 TSP_Boost | |
 TSP_Concorde | |
 TSP_Instance | |
 TSP_PAR | |
 TSP_Param | |
 CbcGenCtlBlk::twomirCtl_struct | Control variable and prototype for Two-MIR cut generator |
 unary_function | |
  AddOffset< T > | |
  AddOffset< T > | |
  TotalWorkload | A functor class used in calulating total workload in a node pool |
 USER_PARAMETERS | |
 USER_PROBLEM | |
 UtilApp | |
 UtilGraphLib | |
 UtilIsGreaterThan< S, T > | |
 UtilIsLessThan< S, T > | |
 UtilParameters | |
 UtilParamT | |
 UtilTimer | |
 LAP::Validator | Class to validate or reject a cut |
 VAR_DESC | |
 vector | |
  DecompCutPool | |
  DecompCutPool | |
  DecompVarPool | |
  DecompVarPool | |
 VERTEX | |
 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 |
  OsiTestSolverInterface | Vol(ume) Solver Interface |
 VOL_vh | |
 VRP_Boost | |
 VRP_CG_PARAMS | |
 VRP_CG_PROBLEM | |
 VRP_Concorde | |
 VRP_CP_PROBLEM | |
 VRP_CVRPsep | |
 VRP_DG | |
 VRP_Instance | |
 VRP_LP_PARAMS | |
 VRP_LP_PROBLEM | |
 VRP_Param | |
 VRP_PARAMS | |
 VRP_PROBLEM | |
 VRP_SPEC_SP | |
 WAITING_ROW | |
 WARM_START_DESC | |
 WINDOW | |
 WINDOW_DESCRIPTION | |