|
Cbc
2.9.5
|
| Campl_info | |
| CCbcBaseModel | Base model |
| CCbcBranchAllDifferent | 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 |
| CCbcBranchCut | Define a cut branching class |
| CCbcBranchDecision | |
| CCbcBranchDefaultDecision | Branching decision default class |
| CCbcBranchDynamicDecision | Branching decision dynamic class |
| CCbcBranchingObject | Abstract branching object base class Now just difference with OsiBranchingObject |
| CCbcBranchToFixLots | Define a branch class that branches so that one way variables are fixed while the other way cuts off that solution |
| CCbcCbcParam | Class for control parameters that act on a CbcModel object |
| CCbcClique | Branching object for cliques |
| CCbcCliqueBranchingObject | Branching object for unordered cliques |
| CCbcCompare | |
| CCbcCompareBase | |
| CCbcCompareDefault | |
| CCbcCompareDepth | |
| CCbcCompareEstimate | |
| CCbcCompareObjective | |
| CCbcConsequence | Abstract base class for consequent bounds |
| CCbcCountRowCut | OsiRowCut augmented with bookkeeping |
| CCbcCutBranchingObject | Cut branching object |
| CCbcCutGenerator | Interface between Cbc and Cut Generation Library |
| CCbcCutModifier | Abstract cut modifier base class |
| CCbcCutSubsetModifier | Simple cut modifier base class |
| CCbcDummyBranchingObject | Dummy branching object |
| CCbcDynamicPseudoCostBranchingObject | Simple branching object for an integer variable with pseudo costs |
| CCbcEventHandler | Base class for Cbc event handling |
| CCbcFathom | Fathom base class |
| CCbcFathomDynamicProgramming | FathomDynamicProgramming class |
| CCbcFeasibilityBase | |
| CCbcFixingBranchingObject | General Branching Object class |
| CCbcFixVariable | Class for consequent bounds |
| CCbcFollowOn | Define a follow on class |
| CCbcFullNodeInfo | Information required to recreate the subproblem at this node |
| ►CCbcGenCtlBlk | |
| CCbcGeneral | Define a catch all class |
| CCbcGenParam | Class for cbc-generic control parameters |
| CCbcHeuristic | Heuristic base class |
| CCbcHeuristicCrossover | Crossover Search class |
| CCbcHeuristicDINS | |
| ►CCbcHeuristicDive | Dive class |
| CCbcHeuristicDiveCoefficient | DiveCoefficient class |
| CCbcHeuristicDiveFractional | DiveFractional class |
| CCbcHeuristicDiveGuided | DiveGuided class |
| CCbcHeuristicDiveLineSearch | DiveLineSearch class |
| CCbcHeuristicDivePseudoCost | DivePseudoCost class |
| CCbcHeuristicDiveVectorLength | DiveVectorLength class |
| CCbcHeuristicDW | This is unlike the other heuristics in that it is very very compute intensive |
| CCbcHeuristicDynamic3 | Heuristic - just picks up any good solution |
| CCbcHeuristicFPump | Feasibility Pump class |
| CCbcHeuristicGreedyCover | Greedy heuristic classes |
| CCbcHeuristicGreedyEquality | |
| CCbcHeuristicGreedySOS | Greedy heuristic for SOS and L rows (and positive elements) |
| CCbcHeuristicJustOne | Just One class - this chooses one at random |
| CCbcHeuristicLocal | LocalSearch class |
| CCbcHeuristicNaive | 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 |
| CCbcHeuristicNode | A class describing the branching decisions that were made to get to the node where a heuristic was invoked from |
| CCbcHeuristicNodeList | |
| CCbcHeuristicPartial | Partial solution class If user knows a partial solution this tries to get an integer solution it uses hotstart information |
| CCbcHeuristicPivotAndFix | LocalSearch class |
| CCbcHeuristicProximity | |
| CCbcHeuristicRandRound | LocalSearch class |
| CCbcHeuristicRENS | LocalSearch class |
| CCbcHeuristicRINS | LocalSearch class |
| CCbcHeuristicVND | LocalSearch class |
| CCbcIdiotBranch | Define an idiotic idea class |
| CCbcIntegerBranchingObject | Simple branching object for an integer variable |
| CCbcIntegerPseudoCostBranchingObject | Simple branching object for an integer variable with pseudo costs |
| CCbcLongCliqueBranchingObject | Unordered Clique Branching Object class |
| CCbcLotsize | Lotsize class |
| CCbcLotsizeBranchingObject | Lotsize branching object |
| CCbcMessage | |
| CCbcModel | Simple Branch and bound class |
| CCbcNauty | |
| CCbcNode | Information required while the node is live |
| CCbcNodeInfo | Information required to recreate the subproblem at this node |
| CCbcNWay | Define an n-way class for variables |
| CCbcNWayBranchingObject | N way branching Object class |
| CCbcObject | |
| CCbcObjectUpdateData | |
| CCbcOrbitalBranchingObject | Branching object for Orbital branching |
| CCbcOsiParam | Class for control parameters that act on a OsiSolverInterface object |
| CCbcOsiSolver | This is for codes where solver needs to know about CbcModel Seems to provide only one value-added feature, a CbcModel object |
| CCbcParam | Very simple class for setting parameters |
| CCbcPartialNodeInfo | Holds information for recreating a subproblem by incremental change from the parent |
| CCbcRounding | Rounding class |
| CCbcRowCuts | |
| CCbcSerendipity | Heuristic - just picks up any good solution found by solver - see OsiBabSolver |
| CCbcSimpleInteger | Define a single integer class |
| CCbcSimpleIntegerDynamicPseudoCost | Define a single integer class but with dynamic pseudo costs |
| CCbcSimpleIntegerPseudoCost | Define a single integer class but with pseudo costs |
| CCbcSolver | This allows the use of the standalone solver in a flexible manner |
| CCbcSolverUsefulData | The CbcSolver class was taken out at a 9/12/09 meeting This is a feeble replacement |
| CCbcSolverUsefulData2 | Structure to hold useful arrays |
| CCbcSOS | Branching object for Special Ordered Sets of type 1 and 2 |
| CCbcSOSBranchingObject | Branching object for Special ordered sets |
| CCbcStatistics | For gathering statistics |
| CCbcStopNow | Support the use of a call back class to decide whether to stop |
| CCbcStrategy | Strategy base class |
| CCbcStrategyDefault | Default class |
| CCbcStrategyDefaultSubTree | Default class for sub trees |
| CCbcStrategyNull | Null class |
| CCbcStrongInfo | Abstract base class for `objects' |
| CCbcSymmetry | Class to deal with symmetry |
| CCbcThread | A class to encapsulate thread stuff |
| CCbcTree | Using MS heap implementation |
| CCbcTreeLocal | |
| CCbcTreeVariable | |
| CCbcUser | A class to allow the use of unknown user functionality |
| CCglTemporary | Stored Temporary Cut Generator Class - destroyed after first use |
| CClpAmplObjective | Ampl Objective Class |
| CClpConstraintAmpl | Ampl Constraint Class |
| CCoinHashLink | 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 |
| Cless_than_str | |
| Cmyclass | |
| Cmyclass0 | |
| CNode | |
| COsiBiLinear | Define BiLinear objects |
| COsiBiLinearBranchingObject | Branching object for BiLinear objects |
| COsiBiLinearEquality | Define Continuous BiLinear objects for an == bound |
| COsiCbcSolverInterface | Cbc Solver Interface |
| COsiChooseStrongSubset | This class chooses a variable to branch on |
| COsiLink | Define Special Linked Ordered Sets |
| COsiLinkBranchingObject | Branching object for Linked ordered sets |
| COsiLinkedBound | List of bounds which depend on other bounds |
| COsiOldLink | |
| COsiOldLinkBranchingObject | Branching object for Linked ordered sets |
| COsiOneLink | Define data for one link |
| COsiSimpleFixedInteger | Define a single integer class - but one where you keep branching until fixed even if satisfied |
| COsiSolverLinearizedQuadratic | This is to allow the user to replace initialSolve and resolve |
| COsiSolverLink | This is to allow the user to replace initialSolve and resolve This version changes coefficients |
| COsiUsesBiLinear | Define a single variable class which is involved with OsiBiLinear objects |
| CPseudoReducedCost |
1.8.9.1