ampl_info | |
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 | 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 |
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 |
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 |
CbcHeuristicRandRound | LocalSearch class |
CbcHeuristicRENS | LocalSearch class |
CbcHeuristicRINS | LocalSearch class |
CbcHeuristicVND | 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 |
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 | |
CbcOsiParam | Class for control parameters that act on a OsiSolverInterface object |
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 |
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 | 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' |
CbcThread | A class to encapsulate thread stuff |
CbcTree | Using MS heap implementationControls search tree debuggingImplementation of the live set as a heap |
CbcTreeLocal | |
CbcTreeVariable | |
CbcUser | A class to allow the use of unknown user functionality |
CglClique::fnode | A node of the fractional graph |
CglClique::frac_graph | A graph corresponding to a fractional solution of an LP |
CglKnapsackCover::cliqueType | Clique type |
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 | |
CglProbing::cliqueType | Clique type |
CglProbing::disaggregation_struct_tag | Disaggregation cuts and for building cliques |
CglTemporary | Stored Temporary Cut Generator Class - destroyed after first use |
ClpAmplObjective | Ampl Objective Class |
ClpConstraintAmpl | Ampl Constraint Class |
ClpHashValue::CoinHashLink | Data |
ClpNode::branchState | |
ClpQuadInterface | This is to allow the user to replace initialSolve and resolve |
CoinLpIO::CoinHashLink | |
CoinMpsIO::CoinHashLink | |
CoinSnapshot::coinOwned | To say whether arrays etc are owned by CoinSnapshot |
LAP::Cuts | To store extra cuts generated by columns from which they origin |
do_tighten_action::action | |
doubleton_action::action | |
drop_empty_cols_action::action | |
drop_empty_rows_action::action | |
dupcol_action::action | |
duprow_action::action | |
forcing_constraint_action::action | |
gubrow_action::action | |
implied_free_action::action | |
LAP::LandPMessages | Message handler for lift-and-project simplex |
LAP::LapMessages | Output messages for Cgl |
make_fixed_action::action | Structure to preserve the bound overwritten when fixing a variable |
myPdco | This implements a simple network matrix as derived from ClpMatrixBase |
OsiBiLinear | Define BiLinear objects |
OsiBiLinearBranchingObject | Branching object for BiLinear objects |
OsiBiLinearEquality | Define Continuous BiLinear objects for an == bound |
OsiCbcSolverInterface | Cbc Solver Interface |
OsiChooseStrongSubset | This class chooses a variable to branch on |
OsiCuts::const_iterator | Const Iterator |
OsiCuts::iterator | Iterator |
OsiCuts::OsiCutCompare | |
OsiLink | Define Special Linked Ordered Sets |
OsiLinkBranchingObject | Branching object for Linked ordered sets |
OsiLinkedBound | List of bounds which depend on other bounds |
OsiLinkedBound::boundElementAction | |
OsiOldLink | |
OsiOldLinkBranchingObject | Branching object for Linked ordered sets |
OsiOneLink | Define data for one link |
OsiSimpleFixedInteger | Define a single integer class - but one where you keep branching until fixed even if satisfied |
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 |
OsiTestSolverInterface | Vol(ume) Solver Interface |
OsiTestSolverInterface::OsiVolMatrixOneMinusOne_ | |
OsiUsesBiLinear | Define a single variable class which is involved with OsiBiLinear objects |
PseudoReducedCost | |
Coin::ReferencedObject | ReferencedObject class |
remove_fixed_action::action | Structure to hold information necessary to reintroduce a column into the problem representation |
slack_doubleton_action::action | |
slack_singleton_action::action | |
Coin::SmartPtr< T > | Template class for Smart Pointers |
subst_constraint_action::action | |
LAP::TabRow | |
OsiUnitTest::TestOutcome | |
OsiUnitTest::TestOutcomes | |
tripleton_action::action | |
useless_constraint_action::action | |
LAP::Validator | Class to validate or reject a cut |
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 |