| ampl_info | |
| BitVector128 | |
| blockStruct | |
| flopc::Boolean_base | |
| 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 |
| CbcBranchCut | Define a cut branching class |
| CbcBranchDecision | Abstract branching decision base class |
| CbcBranchDefaultDecision | Branching decision default class |
| CbcBranchDynamicDecision | Branching decision dynamic class |
| CbcBranchingObject | Abstract branching object base class Now just difference with OsiBranchingObject |
| CbcBranchToFixLots | Define a branch class that branches so that one way variables are fixed while the other way cuts off that solution |
| CbcBranchUserDecision | Branching decision user class |
| CbcCbcParam | Class for control parameters that act on a CbcModel object |
| CbcChooseVariable | |
| CbcClique | Define a clique class |
| CbcCliqueBranchingObject | Branching object for unordered cliques |
| CbcCompare | |
| CbcCompareBase | |
| CbcCompareDefault | |
| CbcCompareDepth | |
| CbcCompareEstimate | |
| CbcCompareObjective | |
| CbcCompareUser | |
| CbcConsequence | Abstract base class for consequent bounds |
| CbcCountRowCut | OsiRowCut augmented with bookkeeping |
| CbcCutBranchingObject | Cut branching object |
| CbcCutGenerator | Interface between Cbc and Cut Generation Library |
| CbcCutModifier | Abstract cut modifier base class |
| CbcCutSubsetModifier | Simple cut modifier base class |
| CbcDummyBranchingObject | Dummy branching object |
| CbcDynamicPseudoCostBranchingObject | Simple branching object for an integer variable with pseudo costs |
| CbcEventHandler | Base class for Cbc event handling |
| CbcFathom | Fathom base class |
| CbcFathomDynamicProgramming | FathomDynamicProgramming class |
| CbcFeasibilityBase | |
| CbcFixingBranchingObject | General Branching Object class |
| CbcFixVariable | Class for consequent bounds |
| CbcFollowOn | Define a follow on class |
| CbcFollowOn2 | Define a follow on class |
| CbcFullNodeInfo | Holds complete information for recreating a subproblem |
| CbcGenCtlBlk | |
| CbcGenCtlBlk::babState_struct | State of branch-and-cut |
| CbcGenCtlBlk::cbcParamsInfo_struct | Start and end of CbcModel parameters in parameter vector |
| CbcGenCtlBlk::chooseStrongCtl_struct | Control variables for a strong branching method |
| CbcGenCtlBlk::cliqueCtl_struct | Control variable and prototype for clique cut generator |
| CbcGenCtlBlk::combineCtl_struct | Control variable and prototype for combine heuristic |
| CbcGenCtlBlk::debugSolInfo_struct | Array of primal variable values for debugging |
| CbcGenCtlBlk::djFixCtl_struct | Control use of reduced cost fixing prior to B&C |
| CbcGenCtlBlk::flowCtl_struct | Control variable and prototype for flow cover cut generator |
| CbcGenCtlBlk::fpumpCtl_struct | Control variable and prototype for feasibility pump heuristic |
| CbcGenCtlBlk::genParamsInfo_struct | Start and end of cbc-generic parameters in parameter vector |
| 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 |
| CbcGenCtlBlk::knapsackCtl_struct | Control variable and prototype for knapsack cover cut generator |
| CbcGenCtlBlk::localTreeCtl_struct | Control variables for local tree |
| CbcGenCtlBlk::mirCtl_struct | Control variable and prototype for MIR cut generator |
| CbcGenCtlBlk::oddHoleCtl_struct | Control variable and prototype for odd hole cut generator |
| CbcGenCtlBlk::osiParamsInfo_struct | Start and end of OsiSolverInterface parameters in parameter vector |
| CbcGenCtlBlk::probingCtl_struct | Control variable and prototype for probing cut generator |
| CbcGenCtlBlk::redSplitCtl_struct | Control variable and prototype for reduce-and-split cut generator |
| CbcGenCtlBlk::roundingCtl_struct | Control variable and prototype for simple rounding heuristic |
| CbcGenCtlBlk::twomirCtl_struct | Control variable and prototype for Two-MIR cut generator |
| CbcGeneral | Define a catch all class |
| CbcGenParam | Class for cbc-generic control parameters |
| CbcHeuristic | Heuristic base class |
| CbcHeuristicDINS | |
| CbcHeuristicDive | Dive class |
| CbcHeuristicDiveCoefficient | DiveCoefficient class |
| CbcHeuristicDiveFractional | DiveFractional class |
| CbcHeuristicDiveGuided | DiveGuided class |
| CbcHeuristicDiveLineSearch | DiveLineSearch class |
| CbcHeuristicDivePseudoCost | DivePseudoCost class |
| CbcHeuristicDiveVectorLength | DiveVectorLength class |
| CbcHeuristicDynamic3 | Heuristic - just picks up any good solution |
| CbcHeuristicFPump | Rounding class |
| CbcHeuristicGreedyCover | Greedy heuristic classes |
| CbcHeuristicGreedyEquality | |
| CbcHeuristicJustOne | Just One class - this chooses one at random |
| CbcHeuristicLocal | LocalSearch class |
| CbcHeuristicNode | A class describing the branching decisions that were made to get to the node where a heuristics was invoked from |
| CbcHeuristicNodeList | |
| CbcHeuristicPartial | Partial solution class If user knows a partial solution this tries to get an integer solution it uses hotstart information |
| CbcHeuristicRENS | LocalSearch class |
| CbcHeuristicRINS | LocalSearch class |
| CbcIntegerBranchingObject | Simple branching object for an integer variable |
| CbcIntegerPseudoCostBranchingObject | Simple branching object for an integer variable with pseudo costs |
| CbcLink | Define Special Linked Ordered Sets |
| CbcLinkBranchingObject | Branching object for Special ordered sets |
| CbcLongCliqueBranchingObject | Unordered Clique Branching Object class |
| CbcLotsize | Lotsize class |
| CbcLotsizeBranchingObject | Lotsize branching object |
| CbcMessage | |
| CbcModel | Simple Branch and bound class |
| CbcNewTree | |
| CbcNode | Information required while the node is live |
| CbcNodeInfo | Information required to recreate the subproblem at this node |
| CbcNWay | Define an n-way class for variables |
| CbcNWayBranchingObject | N way branching Object class |
| CbcObject | |
| CbcObjectUpdateData | |
| CbcOrClpParam | Very simple class for setting parameters |
| CbcOsiParam | Class for control parameters that act on a OsiSolverInterface object |
| CbcOsiSolver | This is for codes where solver needs to know about CbcModel |
| CbcParam | Very simple class for setting parameters |
| CbcPartialNodeInfo | Holds information for recreating a subproblem by incremental change from the parent |
| CbcRounding | Rounding class |
| CbcSerendipity | Heuristic - just picks up any good solution found by solver - see OsiBabSolver |
| 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 |
| CbcSolver | This allows the use of the standalone solver in a flexible manner It has an original OsiClpSolverInterface and CbcModel which it can use repeatedly e.g |
| 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 |
| CbcSolverUsefulData | Structure to hold useful arrays |
| CbcSOS | Define Special Ordered Sets of type 1 and 2 |
| CbcSOSBranchingObject | Branching object for Special ordered sets |
| CbcStatistics | For gathering statistics |
| CbcStopNow | This allows 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' |
| CbcTree | |
| CbcTreeLocal | |
| CbcUser | This allows the use of an unknown user stuff including modeling languages |
| CglAllDifferent | AllDifferent Cut Generator Class This has a number of sets |
| CglClique | |
| CglClique::fnode | A node of the fractional graph |
| CglClique::frac_graph | A graph corresponding to a fractional solution of an LP |
| CglCutGenerator | Cut Generator Base Class |
| CglDuplicateRow | DuplicateRow Cut Generator Class |
| CglFakeClique | |
| CglFlowCover | Lifed Simple Generalized Flow Cover Cut Generator Class |
| CglFlowVUB | Varibale upper bound class |
| CglGomory | Gomory Cut Generator Class |
| CglImplication | This just uses implication info |
| CglKnapsackCover | Knapsack Cover Cut Generator Class |
| CglLandP | |
| CglLandP::CachedData | Some informations that will be changed by the pivots and that we want to keep |
| CglLandP::NoBasisError | |
| CglLandP::Parameters | Class storing parameters |
| CglLandP::SimplexInterfaceError | |
| LAP::CglLandPSimplex | |
| LAP::CglLandPSimplex::extraInfo | |
| LAP::CglLandPSimplex::TabRow | |
| CglLiftAndProject | Lift And Project Cut Generator Class |
| CglMessage | This deals with Cgl messages (as against Osi messages etc) |
| CglMixedIntegerRounding | Mixed Integer Rounding Cut Generator Class |
| CglMixedIntegerRounding2 | Mixed Integer Rounding Cut Generator Class |
| CglMixIntRoundVUB | |
| CglMixIntRoundVUB2 | |
| CglOddHole | Odd Hole Cut Generator Class |
| CglParam | Class collecting parameters for all cut generators |
| CglPreProcess | Class for preProcessing and postProcessing |
| CglProbing | Probing Cut Generator Class |
| CglProbing::cliqueEntry | Entries for clique |
| CglProbing::cliqueType | Clique type |
| CglProbing::disaggregation_struct_tag | Disaggregation cuts and for building cliques |
| CglProbing::disaggregationAction | Only useful type of disaggregation is most normal For now just done for 0-1 variables Can be used for building cliques |
| CglRedSplit | Gomory Reduce-and-Split Cut Generator Class; See method generateCuts() |
| CglRedSplitParam | Class collecting parameters the Reduced-and-split cut generator |
| 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 |
| CglTreeInfo | Information about where the cut generator is invoked from |
| CglTreeProbingInfo | |
| CglTwomir | Twostep MIR Cut Generator Class |
| CglValidator | Class to validate or reject a cut |
| ClpAmplObjective | Ampl Objective Class |
| ClpCholeskyBase | Base class for Clp Cholesky factorization Will do better factorization |
| ClpCholeskyDense | Dense 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 |
| 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 |
| 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 |
| ClpQuadInterface | This is to allow the user to replace initialSolve and resolve |
| 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 |
| CoinAbsFltEq | Equality to an absolute tolerance |
| CoinArrayWithLength | Pointer with length in bytes |
| CoinBigIndexArrayWithLength | CoinBigIndex * version |
| CoinBuild | In many cases it is natural to build a model by adding one row at a time |
| CoinDenseFactorization | This deals with Factorization and Updates This is a simple dense version so other people can write a better one |
| CoinDenseVector< T > | Dense Vector |
| CoinDoubleArrayWithLength | Double * version |
| CoinError | Error Class thrown by an exception |
| 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 |
| CoinFileInput | Abstract base class for file input classes |
| CoinFileIOBase | Base class for FileIO classes |
| 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 |
| CoinIndexedVector | Indexed Vector |
| CoinIntArrayWithLength | Int * version |
| CoinLpIO | Class to read and write Lp files |
| CoinLpIO::CoinHashLink | |
| CoinMessage | The standard set of Coin messages |
| CoinMessageHandler | Base class for message handling |
| CoinMessages | Class to hold and manipulate an array of massaged messages |
| 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 |
| CoinModelHash | |
| CoinModelHash2 | For int,int hashing |
| CoinModelHashLink | For names and hashing |
| CoinModelLink | For going through row or column |
| CoinModelLinkedList | |
| CoinModelTriple | For linked lists |
| CoinMpsCardReader | Very simple code for reading MPS data |
| CoinMpsIO | MPS IO Interface |
| CoinMpsIO::CoinHashLink | |
| CoinOneMessage | Class for one massaged message |
| CoinPackedMatrix | Sparse Matrix Base Class |
| CoinPackedVector | Sparse Vector |
| CoinPackedVectorBase | Abstract base class for various sparse vectors |
| CoinPair< S, T > | An ordered pair |
| CoinParam | A base class for `keyword value' command line parameters |
| CoinPostsolveMatrix | Augments CoinPrePostsolveMatrix with information about the problem that is only needed during postsolve |
| CoinPrePostsolveMatrix | Collects all the information about the problem that is needed in both presolve and postsolve |
| CoinPresolveAction | Abstract base class of all presolve routines |
| CoinPresolveMatrix | Augments CoinPrePostsolveMatrix with information about the problem that is only needed during presolve |
| CoinRelFltEq | Equality to a scaled tolerance |
| CoinSearchTree< Comp > | |
| CoinSearchTreeBase | |
| CoinSearchTreeCompareBest | Best first search |
| CoinSearchTreeCompareBreadth | |
| CoinSearchTreeCompareDepth | Depth First Search |
| CoinSearchTreeComparePreferred | Depth First Search |
| CoinSearchTreeManager | |
| CoinSet | Very simple class for containing data on set |
| CoinShallowPackedVector | Shallow Sparse Vector |
| CoinSnapshot | NON Abstract Base Class for interfacing with cut generators or branching code or |
| CoinSnapshot::coinOwned | To say whether arrays etc are owned by CoinSnapshot |
| CoinSosSet | Very simple class for containing SOS set |
| 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 |
| CoinTreeSiblings | |
| CoinTriple< S, T, U > | |
| CoinUnsignedIntArrayWithLength | Unsigned int * version |
| CoinWarmStart | Abstract base class for warm start information |
| CoinWarmStartBasis | The default COIN simplex (basis-oriented) warm start class |
| CoinWarmStartBasisDiff | A `diff' between two CoinWarmStartBasis objects |
| CoinWarmStartDiff | Abstract base class for warm start `diff' objects |
| CoinWarmStartDual | WarmStart information that is only a dual vector |
| CoinWarmStartDualDiff | A `diff' between two CoinWarmStartDual objects |
| CoinWarmStartPrimalDual | WarmStart information that is only a dual vector |
| CoinWarmStartPrimalDualDiff | A `diff' between two CoinWarmStartPrimalDual objects |
| CoinWarmStartVector< T > | WarmStart information that is only a vector |
| CoinWarmStartVectorDiff< T > | A `diff' between two CoinWarmStartVector objects |
| CoinWarmStartVectorPair< T, U > | |
| CoinWarmStartVectorPairDiff< T, U > | |
| CoinYacc | |
| flopc::Constant | Reference counted class for all "constant" types of data |
| flopc::Constant_base | Base class for all "constant" types of data |
| flopc::Constraint | |
| flopc::Constraint_base | Semantic representation of a constraint in a Math Program |
| cutParams | |
| flopc::DataRef | Reference to a set of data |
| DGG_constraint_t | |
| DGG_data_t | |
| DGG_list_t | |
| do_tighten_action | |
| do_tighten_action::action | |
| doubleton_action | Solve ax+by=c for y and substitute y out of the problem |
| doubleton_action::action | |
| drop_empty_cols_action | Physically removes empty columns in presolve, and reinserts empty columns in postsolve |
| drop_empty_cols_action::action | |
| drop_empty_rows_action | Physically removes empty rows in presolve, and reinserts empty rows in postsolve |
| drop_empty_rows_action::action | |
| drop_zero_coefficients_action | Removal of explicit zeros |
| dropped_zero | Tracking information for an explicit zero coefficient |
| dupcol_action | Detect and remove duplicate columns |
| dupcol_action::action | |
| duprow_action | Detect and remove duplicate rows |
| duprow_action::action | |
| fixEntry | Derived class to pick up probing info |
| forcing_constraint_action | Detect and process forcing constraints and useless constraints |
| forcing_constraint_action::action | |
| flopc::Functor | Function object |
| flopc::Handle< T > | Utility for doing reference counted pointers |
| Idiot | This class implements a very silly algorithm |
| IdiotResult | For use internally |
| implied_free_action | Detect and process implied free variables |
| implied_free_action::action | |
| Info | ******** DATA to be moved into protected section of ClpInterior |
| flopc::insertFunctor< nbr > | Inserter for construction of a subset |
| flopc::InsertFunctor< nbr > | Internal representation of a "set" |
| isolated_constraint_action | |
| LAP::LandPMessages | Message handler for lift-and-project simplex |
| LAP::LapMessages | Output messages for Cgl |
| make_fixed_action | Fix a variable at a specified bound |
| make_fixed_action::action | Structure to preserve the bound overwritten when fixing a variable |
| flopc::Messenger | Inteface for hooking up to internal flopc++ message handling |
| flopc::MP | |
| flopc::MP::Coef | |
| flopc::MP::CoefLess | |
| flopc::MP::GenerateFunctor | |
| flopc::MP_binary_variable | Specialized subclass of MP_variable where the variable is pre-specified to be binary |
| flopc::MP_boolean | Reference counted class for all "boolean" types of data |
| flopc::MP_constraint | Semantic representation of a linear constraint |
| flopc::MP_data | Input data set |
| flopc::MP_domain | Range over which some other constuct is defined |
| flopc::MP_domain_base | Reference to a set of index values |
| flopc::MP_domain_set | Range over which some other constuct is defined |
| flopc::MP_domain_subset< nbr > | Range over which some other constuct is defined |
| flopc::MP_expression | Symbolic representation of a linear expression |
| flopc::MP_expression_base | The base class for all expressions |
| flopc::MP_index | Representation of an index |
| flopc::MP_index_base | Internal representation of a index |
| flopc::MP_index_dif | Internal representation of an index expression |
| flopc::MP_index_exp | Representation of an expression involving an index |
| flopc::MP_index_mult | Internal representation of an index expression |
| flopc::MP_index_sum | Internal representation of an index expression |
| flopc::MP_model | This is the anchor point for all constructs in a FlopC++ model |
| flopc::MP_set | Representation of a set for indexing into some other construct |
| flopc::MP_set_base | Internal representation of a "set" |
| flopc::MP_stage | |
| flopc::MP_stochastic_data | |
| flopc::MP_subset< nbr > | Internal representation of a "set" |
| flopc::MP_variable | Symantic representation of 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 |
| flopc::Named | Utility interface class for adding a string name onto a structure |
| flopc::NormalMessenger | Internal use: used when Normal output is selected |
| Options | ******** DATA to be moved into protected section of ClpInterior |
| 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 |
| OsiBiLinear | Define BiLinear objects |
| OsiBiLinearBranchingObject | Branching object for BiLinear objects |
| OsiBiLinearEquality | Define Continuous BiLinear objects for an == bound |
| OsiBranchingInformation | |
| OsiBranchingObject | Abstract branching object base class |
| OsiCbcSolverInterface | Cbc Solver Interface |
| OsiChooseStrong | This class chooses a variable to branch on |
| OsiChooseStrongSubset | This class chooses a variable to branch on |
| OsiChooseVariable | This class chooses a variable to branch on |
| OsiClpDisasterHandler | |
| OsiClpSolverInterface | Clp Solver Interface |
| OsiColCut | Column Cut Class |
| OsiCpxSolverInterface | CPLEX Solver Interface |
| OsiCut | |
| OsiCuts | Collections of row cuts and column cuts |
| OsiCuts::const_iterator | Const Iterator |
| OsiCuts::iterator | Iterator |
| OsiCuts::OsiCutCompare | |
| OsiDylpSolverInterface | COIN OSI layer for dylp |
| OsiDylpWarmStartBasis | The dylp warm start class |
| OsiDylpWarmStartBasisDiff | A `diff' between two OsiDylpWarmStartBasis objects |
| OsiFmpSolverInterface | OSL Solver Interface |
| OsiGlpkSolverInterface | GPLK Solver Interface |
| OsiHotInfo | This class contains the result of strong branching on a variable When created it stores enough information for strong branching |
| OsiIntegerBranchingObject | Simple branching object for an integer variable |
| OsiLink | Define Special Linked Ordered Sets |
| OsiLinkBranchingObject | Branching object for Linked ordered sets |
| OsiLinkedBound | List of bounds which depend on other bounds |
| OsiLinkedBound::boundElementAction | |
| OsiLotsize | Lotsize class |
| OsiLotsizeBranchingObject | Lotsize branching object |
| OsiMskSolverInterface | |
| OsiObject | Abstract base class for `objects' |
| OsiObject2 | Define a class to add a bit of complexity to OsiObject This assumes 2 way branching |
| OsiOldLink | |
| OsiOldLinkBranchingObject | Branching object for Linked ordered sets |
| OsiOneLink | Define data for one link |
| OsiOslSolverInterface | OSL Solver Interface |
| OsiPresolve | OSI interface to COIN problem simplification capabilities |
| OsiPseudoCosts | This class is the placeholder for the pseudocosts used by OsiChooseStrong |
| OsiRowCut | Row Cut Class |
| OsiRowCut2 | Row Cut Class which refers back to row which created it |
| OsiRowCutDebugger | Validate Row Cut Generator |
| OsiSimpleFixedInteger | Define a single integer class - but one where you keep branching until fixed even if satisfied |
| OsiSimpleInteger | Define a single integer class |
| OsiSolverBranch | Solver Branch Class |
| OsiSolverInterface | Solver Interface Abstract Base Class |
| OsiSolverInterface::ApplyCutsReturnCode | Internal class for obtaining status from the applyCuts method |
| OsiSolverLinearizedQuadratic | This is to allow the user to replace initialSolve and resolve |
| OsiSolverLink | This is to allow the user to replace initialSolve and resolve This version changes coefficients |
| OsiSolverResult | Solver Result Class |
| OsiSOS | Define Special Ordered Sets of type 1 and 2 |
| OsiSOSBranchingObject | Branching object for Special ordered sets |
| OsiSpxSolverInterface | SOPLEX Solver Interface |
| OsiSymSolverInterface | OSI Solver Interface for SYMPHONY |
| OsiTwoWayBranchingObject | This just adds two-wayness to a branching object |
| OsiUsesBiLinear | Define a single variable class which is involved with OsiBiLinear objects |
| OsiVolSolverInterface | Vol(ume) Solver Interface |
| OsiVolSolverInterface::OsiVolMatrixOneMinusOne_ | |
| OsiXprSolverInterface | XPRESS-MP Solver Interface |
| Outfo | ******** DATA to be moved into protected section of ClpInterior |
| PLess< T > | |
| presolvehlink | Links to aid in packed matrix modification |
| Coin::ReferencedObject | ReferencedObject class |
| remove_dual_action | Attempt to fix variables by bounding reduced costs |
| remove_fixed_action | Excise fixed variables from the model |
| remove_fixed_action::action | Structure to hold information necessary to reintroduce a column into the problem representation |
| flopc::RowMajor | Utility class to flatten multidimensional information into single dimentional offset information |
| slack_doubleton_action | Convert an explicit bound constraint to a column bound |
| slack_doubleton_action::action | |
| slack_singleton_action | For variables with one entry |
| slack_singleton_action::action | |
| Coin::SmartPtr< T > | Template class for Smart Pointers |
| SmiCoreCombineAdd | |
| SmiCoreCombineReplace | |
| SmiCoreCombineRule | This deals with combining Core and Stochastic data |
| SmiCoreData | |
| SmiDiscreteDistribution | |
| SmiDiscreteEvent | |
| SmiDiscreteRV | |
| SmiLinearData | |
| SmiMessage | This deals with Clp messages (as against Osi messages etc) |
| SmiNodeData | |
| SmiScenarioTree< T > | |
| SmiScnModel | SmiScnModel: COIN-SMI Scenario Model Class |
| SmiScnModelAddNode | |
| SmiScnModelDeleteNode | |
| SmiScnNode | |
| SmiSmpsCardReader | |
| SmiSmpsIO | |
| SmiTreeNode< T > | SmiTreeNode template class |
| flopc::SubsetRef< nbr > | Internal representation of a "set" |
| flopc::SUBSETREF | Internal representation of a "set" |
| subst_constraint_action | |
| subst_constraint_action::action | |
| symrec | For string evaluation |
| SymWarmStart | |
| flopc::TerminalExpression | The base class for all expressions |
| TestBed | |
| TestItem | |
| tree | Implementation of live set as a heap |
| tripleton_action | We are only going to do this if it does not increase number of elements? |
| tripleton_action::action | |
| useless_constraint_action | |
| useless_constraint_action::action | |
| flopc::VariableRef | Semantic representation of a variable in a Math Program |
| flopc::VerboseMessenger | Internal use: used when Verbose output is selected |
