ampl_info | |
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 |
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 |
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 |
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 |
CbcHeuristic | Heuristic base class |
CbcHeuristicFPump | Rounding class |
CbcHeuristicGreedyCover | Greedy heuristic classes |
CbcHeuristicGreedyEquality | |
CbcHeuristicLocal | 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 | |
CbcOrClpParam | Very simple class for setting parameters |
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 |
CbcSimpleIntegerPseudoCost | Define a single integer class but with pseudo costs |
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 |
CbcSOS | Define Special Ordered Sets of type 1 and 2 |
CbcSOSBranchingObject | Branching object for Special ordered sets |
CbcStatistics | For gathering statistics |
CbcStrategy | Strategy base class |
CbcStrategyDefault | Default class |
CbcStrategyDefaultSubTree | Default class for sub trees |
CbcStrategyNull | Null class |
CbcStrongInfo | Abstract base class for `objects' |
CbcTree | |
CbcTreeLocal | |
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 |
CglFlowCover | Lifed Simple Generalized Flow Cover Cut Generator Class |
CglFlowVUB | Varibale upper bound class |
CglGomory | Gomory Cut Generator Class |
CglKnapsackCover | Knapsack Cover Cut Generator Class |
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 |
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() |
CglSimpleRounding | Simple Rounding Cut Generator Class
|
CglStored | Stored Cut Generator Class |
CglTreeInfo | Information about where the cut generator is invoked from |
CglTwomir | Twostep MIR Cut Generator 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 |
ClpDataSave | This is a tiny class where data can be saved round calls |
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 |
ClpInterior | This solves LPs using interior point methods |
ClpLinearObjective | Linear Objective Class |
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 |
ClpNonLinearCost | |
ClpObjective | Objective Abstract Base Class |
ClpPackedMatrix | |
ClpPackedMatrix2 | |
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 |
Cname | |
CoinAbsFltEq | Equality to an absolute tolerance |
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 |
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 |
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 |
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 |
CoinSet | Very simple class for containing data on set |
CoinShallowPackedVector | Shallow Sparse Vector |
CoinSosSet | Very simple class for containing SOS set |
CoinTimer | This class implements a timer that also implements a tracing functionality |
CoinTriple< S, T, U > | |
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 |
CoinYacc | |
cutParams | |
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 | |
forcing_constraint_action | Detect and process forcing constraints and useless constraints |
forcing_constraint_action::action | |
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 |
isolated_constraint_action | |
Lp | |
LP_data_and_hook | |
LP_parms | |
make_fixed_action | Fix a variable at a specified bound |
make_fixed_action::action | Structure to preserve the bound overwritten when fixing a variable |
MyEventHandler | This is so user can trap events and do useful stuff |
MyMessageHandler | |
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 |
OsiCbcSolverInterface | Cbc Solver Interface |
OsiClpSolverInterface | Clp Solver Interface |
OsiColCut | Column Cut Class |
OsiCpxSolverInterface | CPLEX Solver Interface |
OsiCut | Base Class for cut |
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 |
OsiMskSolverInterface | |
OsiOslSolverInterface | OSL Solver Interface |
OsiPresolve | OSI interface to COIN problem simplification capabilities |
OsiRowCut | Row Cut Class |
OsiRowCut2 | Row Cut Class which refers back to row which created it |
OsiRowCutDebugger | Validate Row Cut Generator |
OsiSolverBranch | Solver Branch Class |
OsiSolverInterface | Solver Interface Abstract Base Class |
OsiSolverInterface::ApplyCutsReturnCode | Internal class for obtaining status from the applyCuts method |
OsiSolverResult | Solver Result Class |
OsiSpxSolverInterface | SOPLEX Solver Interface |
OsiSymSolverInterface | OSI Solver Interface for SYMPHONY |
OsiVolSolverInterface | Vol(ume) Solver Interface |
OsiVolSolverInterface::OsiVolMatrixOneMinusOne_ | |
OsiXprSolverInterface | XPRESS-MP Solver Interface |
Outfo | ******** DATA to be moved into protected section of ClpInterior |
presolvehlink | Links to aid in packed matrix modification |
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 |
Rname | |
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 | |
subst_constraint_action | |
subst_constraint_action::action | |
symrec | For string evaluation |
SymWarmStart | |
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 | |
UFL | |
UFL_parms | |
useless_constraint_action | |
useless_constraint_action::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 | |