Cbc
2.10.5
|
CbcCbcParamUtils | |
CbcGenParamUtils | |
CbcOsiParamUtils | |
Coin | |
CoinParamUtils | Utility functions for processing CoinParam parameters |
LAP | Performs one round of Lift & Project using CglLandPSimplex to build cuts |
OsiUnitTest | A namespace so we can define a few `global' variables to use during tests |
soplex | |
_EKKfactinfo | |
AbcDualRowDantzig | Dual Row Pivot Dantzig Algorithm Class |
AbcDualRowPivot | Dual Row Pivot Abstract Base Class |
AbcDualRowSteepest | Dual Row Pivot Steepest Edge Algorithm Class |
AbcMatrix | |
AbcMatrix2 | |
AbcMatrix3 | |
AbcNonLinearCost | |
AbcPrimalColumnDantzig | Primal Column Pivot Dantzig Algorithm Class |
AbcPrimalColumnPivot | Primal Column Pivot Abstract Base Class |
AbcPrimalColumnSteepest | Primal Column Pivot Steepest Edge Algorithm Class |
AbcSimplex | |
AbcSimplexDual | This solves LPs using the dual simplex method |
AbcSimplexFactorization | This just implements AbcFactorization when an AbcMatrix object is passed |
AbcSimplexPrimal | This solves LPs using the primal simplex method |
AbcTolerancesEtc | |
AbcWarmStart | As CoinWarmStartBasis but with alternatives (Also uses Clp status meaning for slacks) |
AbcWarmStartOrganizer | |
ampl_info | |
auxiliary_graph | |
BitVector128 | |
blockStruct | |
blockStruct3 | |
CbcBaseModel | Base model |
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 | |
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 |
CbcClique | Branching object for cliques |
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 | Information required to recreate the subproblem at this node |
CbcGenCtlBlk | |
CbcGeneral | Define a catch all class |
CbcGenParam | Class for cbc-generic control parameters |
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 |
CbcHeuristicNode | A class describing the branching decisions that were made to get to the node where a heuristic 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 |
CbcHeuristicPivotAndFix | LocalSearch class |
CbcHeuristicProximity | |
CbcHeuristicRandRound | LocalSearch class |
CbcHeuristicRENS | LocalSearch class |
CbcHeuristicRINS | LocalSearch class |
CbcHeuristicVND | LocalSearch class |
CbcIdiotBranch | Define an idiotic idea 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 |
CbcNauty | |
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 | |
CbcOrbitalBranchingObject | Branching object for Orbital branching |
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 Seems to provide only one value-added feature, a CbcModel object |
CbcParam | Very simple class for setting parameters |
CbcPartialNodeInfo | Holds information for recreating a subproblem by incremental change from the parent |
CbcRounding | Rounding class |
CbcRowCuts | |
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 |
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 | The CbcSolver class was taken out at a 9/12/09 meeting This is a feeble replacement |
CbcSolverUsefulData2 | Structure to hold useful arrays |
CbcSOS | Branching object for Special Ordered Sets of type 1 and 2 |
CbcSOSBranchingObject | Branching object for Special ordered sets |
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 |
Cgl012Cut | 012Cut Generator Class |
cgl_arc | |
cgl_graph | |
cgl_node | |
CglAllDifferent | AllDifferent Cut Generator Class This has a number of sets |
CglBK | For Bron-Kerbosch |
CglClique | |
CglCutGenerator | Cut Generator Base Class |
CglDuplicateRow | DuplicateRow Cut Generator Class |
CglFakeClique | |
CglFlowCover | Lifed Simple Generalized Flow Cover Cut Generator Class |
CglFlowVUB | Variable upper bound class |
CglGMI | Gomory cut generator with several cleaning procedures, used to test the numerical safety of the resulting cuts |
CglGMIParam | Class collecting parameters for the GMI cut generator |
CglGomory | Gomory Cut Generator Class |
CglHashLink | Only store unique row cuts |
CglImplication | This just uses implication info |
CglKnapsackCover | Knapsack Cover Cut Generator Class |
CglLandP | |
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 |
CglRedSplit | Gomory Reduce-and-Split Cut Generator Class; See method generateCuts() |
CglRedSplit2 | Reduce-and-Split Cut Generator Class; See method generateCuts() |
CglRedSplit2Param | Class collecting parameters the Reduced-and-split cut generator |
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 |
CglUniqueRowCuts | |
CglZeroHalf | Zero Half Cut Generator Class |
CliqueEntry | Derived class to pick up probing info |
ClpAmplObjective | Ampl Objective Class |
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 |
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 | |
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 | |
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 |
ClpPEDualRowDantzig | |
ClpPEDualRowSteepest | Dual Row Pivot Steepest Edge Algorithm Class |
ClpPEPrimalColumnDantzig | |
ClpPEPrimalColumnSteepest | Primal Column Pivot Steepest Edge Algorithm Class |
ClpPESimplex | BASE CLASS FOR THE IMPROVED SIMPLEX |
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 |
clpTempInfo | |
ClpTrustedData | For a structure to be used by trusted code |
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 |
CoinAbcStack | |
CoinAbcStatistics | |
CoinAbcTypeFactorization | |
CoinAbsFltEq | Equality to an absolute tolerance |
CoinArbitraryArrayWithLength | Arbitrary version |
CoinArrayWithLength | Pointer with length in bytes |
CoinBaseModel | |
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 | Dense Vector |
CoinDoubleArrayWithLength | Double * version |
CoinError | Error Class thrown by an exception |
CoinExternalVectorFirstGreater_2 | Function operator |
CoinExternalVectorFirstGreater_3 | Function operator |
CoinExternalVectorFirstLess_2 | Function operator |
CoinExternalVectorFirstLess_3 | Function operator |
CoinFactorization | This deals with Factorization and Updates |
CoinFactorizationDoubleArrayWithLength | CoinFactorizationDouble * version |
CoinFactorizationLongDoubleArrayWithLength | CoinFactorizationLongDouble * version |
CoinFileInput | Abstract base class for file input classes |
CoinFileIOBase | Base class for FileIO classes |
CoinFileOutput | Abstract base class for file output classes |
CoinFirstAbsGreater_2 | Function operator |
CoinFirstAbsGreater_3 | Function operator |
CoinFirstAbsLess_2 | Function operator |
CoinFirstAbsLess_3 | Function operator |
CoinFirstGreater_2 | Function operator |
CoinFirstGreater_3 | Function operator |
CoinFirstLess_2 | Function operator |
CoinFirstLess_3 | Function operator |
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 |
CoinIndexedVector | Indexed Vector |
CoinIntArrayWithLength | Int * version |
CoinLpIO | Class to read and write Lp files |
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 |
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 |
CoinOslFactorization | |
CoinOtherFactorization | Abstract base class which also has some scalars so can be used from Dense or Simp |
CoinPackedMatrix | Sparse Matrix Base Class |
CoinPackedVector | Sparse Vector |
CoinPackedVectorBase | Abstract base class for various sparse vectors |
CoinPair | An ordered pair |
CoinParam | A base class for `keyword value' command line parameters |
CoinPartitionedVector | |
CoinPlainFileInput | This reads plain text files |
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 |
CoinPresolveMonitor | Monitor a row or column for modification |
CoinRational | |
CoinRelFltEq | Equality to a scaled tolerance |
CoinSearchTree | |
CoinSearchTreeBase | |
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 |
CoinShallowPackedVector | Shallow Sparse Vector |
CoinSimpFactorization | |
CoinSnapshot | NON Abstract Base Class for interfacing with cut generators or branching code or |
CoinSosSet | Very simple class for containing SOS set |
CoinStructuredModel | |
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 | |
CoinUnsignedIntArrayWithLength | Unsigned int * version |
CoinVoidStarArrayWithLength | Void * 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 | WarmStart information that is only a vector |
CoinWarmStartVectorDiff | A `diff' between two CoinWarmStartVector objects |
CoinWarmStartVectorPair | |
CoinWarmStartVectorPairDiff | |
CoinYacc | |
cut | |
cut_list | |
cutParams | |
cycle | |
cycle_list | |
DGG_constraint_t | |
DGG_data_t | |
DGG_list_t | |
disaggregationAction | Only useful type of disaggregation is most normal For now just done for 0-1 variables Can be used for building cliques |
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 |
dropped_zero | Tracking information for an explicit zero coefficient |
dualColumnResult | |
dupcol_action | Detect and remove duplicate columns |
duprow3_action | |
duprow_action | Detect and remove duplicate rows |
edge | |
EKKHlink | This deals with Factorization and Updates This is ripped off from OSL!!!!!!!!! |
FactorPointers | Pointers used during factorization |
forcing_constraint_action | Detect and process forcing constraints and useless constraints |
glp_prob | |
gubrow_action | Detect and remove entries whose sum is known |
Idiot | This class implements a very silly algorithm |
IdiotResult | For use internally |
ilp | |
implied_free_action | Detect and process implied free variables |
Info | ******** DATA to be moved into protected section of ClpInterior |
info_weak | |
isolated_constraint_action | |
log_var | |
make_fixed_action | Fix a variable at a specified bound |
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 |
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 |
OsiGlpkSolverInterface | |
OsiGrbSolverInterface | Gurobi 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 |
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 |
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 cuts against a known solution |
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 | Abstract Base Class for describing an interface to a solver |
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 Instantiation of OsiSpxSolverInterface for SoPlex |
OsiTestSolverInterface | Vol(ume) Solver Interface |
OsiTwoWayBranchingObject | This just adds two-wayness to a branching object |
OsiUsesBiLinear | Define a single variable class which is involved with OsiBiLinear objects |
OsiXprSolverInterface | XPRESS-MP Solver Interface |
Outfo | ******** DATA to be moved into protected section of ClpInterior |
parity_ilp | |
pool_cut | |
pool_cut_list | |
presolvehlink | Links to aid in packed matrix modification |
PseudoReducedCost | |
remove_dual_action | Attempt to fix variables by bounding reduced costs |
remove_fixed_action | Excise fixed variables from the model |
scatterStruct | |
select_cut | |
separation_graph | |
short_path_node | |
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 |
symrec | For string evaluation |
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 | |
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 |