- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files

- Class List
- Class Index
- Class Hierarchy
- Class Members

Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 1 2 3 4 5]

_EKKfactinfo |
_NODE |
AbcBranchDecision | Abstract branching decision base class
AbcBranchDefaultDecision | Branching decision default class
AbcCutGenerator | Interface between Abc and Cut Generation Library
AbcDualRowPivot | Dual Row Pivot Abstract Base Class
AbcDualRowDantzig | Dual Row Pivot Dantzig Algorithm Class
AbcDualRowSteepest | Dual Row Pivot Steepest Edge Algorithm Class
AbcHeuristic | Heuristic base class
AbcRounding | Rounding class
AbcMatrix |
AbcMatrix2 |
AbcMatrix3 |
AbcNonLinearCost |
AbcPrimalColumnPivot | Primal Column Pivot Abstract Base Class
AbcPrimalColumnDantzig | Primal Column Pivot Dantzig Algorithm Class
AbcPrimalColumnSteepest | Primal Column Pivot Steepest Edge Algorithm Class
AbcPseudocost |
AbcSimplexFactorization | This just implements AbcFactorization when an AbcMatrix object is passed
AbcTolerancesEtc |
AbcWarmStartOrganizer |
doubleton_action::action |
remove_dual_action::action | Postsolve (bound restore) instruction
dupcol_action::action |
duprow_action::action |
duprow3_action::action |
gubrow_action::action |
twoxtwo_action::action |
drop_empty_cols_action::action |
drop_empty_rows_action::action |
remove_fixed_action::action | Structure to hold information necessary to reintroduce a column into the problem representation
make_fixed_action::action | Structure to preserve the bound overwritten when fixing a variable
forcing_constraint_action::action |
implied_free_action::action |
slack_doubleton_action::action |
slack_singleton_action::action |
subst_constraint_action::action |
do_tighten_action::action |
tripleton_action::action |
useless_constraint_action::action |
ALPS_PS_STATS |
AlpsEncoded | This data structure is to contain the packed form of an encodable knowledge
AlpsKnowledge | The abstract base class of any user-defined class that Alps has to know about in order to encode/decode
AlpsModel |
AbcModel | Model class for ALPS Branch and Cut
BcpsModel |
BlisModel |
VrpModel | Model class for VRP
BlisModel |
KnapModel |
AlpsSolution |
AbcSolution | This class holds a MIP feasible primal solution
BcpsSolution | This class holds the solution objects
BlisSolution | This class contains the solutions generated by the LP solver (either primal or dual
VrpSolution | This class contains a vrp solution
BlisSolution | This class contains the solutions generated by the LP solver (either primal or dual
KnapSolution |
AlpsSubTree | This class contains the data pertaining to a particular subtree in the search tree
BcpsSubTree | This class is the data structure for storing a subtree within BCPS
AlpsTreeNode | This class holds one node of the search tree
AbcTreeNode |
BcpsTreeNode | This class contain the data for a BCPS search tree node
BlisTreeNode | This is the class in which we are finally able to concretely define the bounding procedure
BlisTreeNode | This is the class in which we are finally able to concretely define the bounding procedure
BlisTreeNode | This is the class in which we are finally able to concretely define the bounding procedure
BlisTreeNode | This is the class in which we are finally able to concretely define the bounding procedure
KnapTreeNode |
BcpsObject | A class for describing the objects that comprise a BCPS subproblem
BcpsConstraint |
BlisConstraint |
BlisConstraint |
BcpsVariable |
BlisVariable |
VrpVariable | Variable class for VRP
BlisVariable |
BlisObjectInt |
BlisObjectInt |
BlisPseudocost |
AlpsKnowledgeBroker | The base class of knowledge broker class
AlpsKnowledgeBrokerMPI |
AlpsKnowledgeBrokerSerial |
AlpsKnowledgePool |
AlpsNodePool | Node pool is used to store the nodes to be processed
AlpsSolutionPool | In the solution pool we assume that the lower the priority value the more desirable the solution is
AlpsSubTreePool | The subtree pool is used to store subtrees
BcpsObjectPool | Object pool is used to store objects
BcpsConstraintPool |
BcpsVariablePool |
AlpsNodeDesc | A class to refer to the description of a search tree node
AbcNodeDesc |
BcpsNodeDesc | For a given type, the objectVecStorage_ structure holds the description
BlisNodeDesc |
BlisNodeDesc |
KnapNodeDesc |
AlpsParameter | This parameter indeintifies a single parameter entry
AlpsParameterSet | This is the class serves as a holder for a set of parameters
AbcParams |
AlpsParams |
BlisParams |
BlisParams |
KnapParams |
VrpParams |
AlpsPriorityQueue< T > |
AlpsPriorityQueue< AlpsSubTree * > |
AlpsPriorityQueue< AlpsTreeNode * > |
AlpsSearchStrategy |
AlpsNodeSelection |
AlpsNodeSelectionBest |
AlpsNodeSelectionBreadth |
AlpsNodeSelectionDepth |
AlpsNodeSelectionEstimate |
AlpsNodeSelectionHybrid |
AlpsTreeSelection |
AlpsTreeSelectionBest |
AlpsTreeSelectionBreadth |
AlpsTreeSelectionDepth |
AlpsTreeSelectionEstimate |
AlpsStrLess | A function object to perform lexicographic lexicographic comparison between two C style strings
AlpsTimer |
ampl_info |
OsiSolverInterface::ApplyCutsReturnCode | Internal class for obtaining status from the applyCuts method
auxiliary_graph |
BcpsBranchObject | BcpsBranchObject contains the member data required when choosing branching entities and excuting actual branching
BlisBranchObjectBilevel |
BlisBranchObjectInt |
BlisBranchObjectInt |
BcpsBranchStrategy | Branching strategy specifies: (1) how to select a candidate set of branching objects (2) how to compare two branching objects
BlisBranchStrategyBilevel | This class implements maximum infeasibility branching
BlisBranchStrategyMaxInf | This class implements maximum infeasibility branching
BlisBranchStrategyPseudo | Blis branching strategy default class This class implements a simple default algorithm, betterBranchObject(), for choosing a branching variable
BlisBranchStrategyPseudo | Blis branching strategy default class This class implements a simple default algorithm, betterBranchObject(), for choosing a branching variable
BlisBranchStrategyRel | Blis branching strategy default class This class implements a simple default algorithm, betterBranchObject(), for choosing a branching variable
BlisBranchStrategyRel | Blis branching strategy default class This class implements a simple default algorithm, betterBranchObject(), for choosing a branching variable
BlisBranchStrategyStrong | Blis branching strategy default class This class implements a simple default algorithm, betterBranchObject(), for choosing a branching variable
BlisBranchStrategyStrong | Blis branching strategy default class This class implements a simple default algorithm, betterBranchObject(), for choosing a branching variable
BcpsFieldListMod< T > | This class contains modifications for a single `std::vector<T>` object
BcpsFieldListMod< double > |
BcpsFieldListMod< int > |
BcpsObjectListMod | Here is the set of `vectorMod_` objects that represent the list of objects of a particular type (either in relative or explicit form)
BEST_TOURS |
BitVector128 |
BlisConGenerator | Interface between Blis and Cut Generation Library
VrpCutGenerator |
BlisHeuristic | Heuristic base class
BlisHeurRound | Rounding Heuristic
BlisHeurRound | Rounding Heuristic
VrpHeurTSP |
BlisStrong |
blockStruct |
blockStruct3 |
ClpNode::branchState |
CglLandP::CachedData | Some informations that will be changed by the pivots and that we want to keep
CbcOrClpParam | Very simple class for setting parameters
Cgl012Cut | 012Cut Generator Class
cgl_arc |
cgl_graph |
cgl_node |
CglBK | For Bron-Kerbosch
CglCutGenerator | Cut Generator Base Class
CglAllDifferent | AllDifferent Cut Generator Class This has a number of sets
CglClique |
CglFakeClique |
CglDuplicateRow | DuplicateRow Cut Generator Class
CglFlowCover | Lifed Simple Generalized Flow Cover Cut Generator Class
CglGMI | Gomory cut generator with several cleaning procedures, used to test the numerical safety of the resulting cuts
CglGomory | Gomory Cut Generator Class
CglImplication | This just uses implication info
CglKnapsackCover | Knapsack Cover Cut Generator Class
CglLandP |
CglLiftAndProject | Lift And Project Cut Generator Class
CglMixedIntegerRounding | Mixed Integer Rounding Cut Generator Class
CglMixedIntegerRounding2 | Mixed Integer Rounding Cut Generator Class
CglOddHole | Odd Hole Cut Generator Class
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()
CglResidualCapacity | Residual Capacity Inequalities Cut Generator Class
CglSimpleRounding | Simple Rounding Cut Generator Class
CglStored | Stored Cut Generator Class
CglTwomir | Twostep MIR Cut Generator Class
CglZeroHalf | Zero Half Cut Generator Class
CglFlowVUB | Variable upper bound class
CglHashLink | Only store unique row cuts
LAP::CglLandPSimplex |
CglMixIntRoundVUB |
CglMixIntRoundVUB2 |
CglParam | Class collecting parameters for all cut generators
CglGMIParam | Class collecting parameters for the GMI cut generator
CglLandP::Parameters | Class storing parameters
CglRedSplit2Param | Class collecting parameters the Reduced-and-split cut generator
CglRedSplitParam | Class collecting parameters the Reduced-and-split cut generator
CglPreProcess | Class for preProcessing and postProcessing
CglTreeInfo | Information about where the cut generator is invoked from
CglTreeProbingInfo |
CglUniqueRowCuts |
CliqueEntry | Derived class to pick up probing info
CglProbing::CliqueType | Clique type
CglKnapsackCover::CliqueType | Clique type
ClpCholeskyBase | Base class for Clp Cholesky factorization Will do better factorization
ClpCholeskyDense |
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
ClpCholeskyDenseC |
ClpConstraint | Constraint Abstract Base 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
OsiClpDisasterHandler |
ClpDualRowPivot | Dual Row Pivot Abstract Base Class
ClpDualRowDantzig | Dual Row Pivot Dantzig Algorithm Class
ClpDualRowSteepest | Dual Row Pivot Steepest Edge Algorithm Class
ClpEventHandler | Base class for Clp event handling
MyEventHandler | This is so user can trap events and do useful stuff
ClpFactorization | This just implements CoinFactorization when an ClpMatrixBase object is passed
ClpHashValue |
ClpLsqr | This class implements LSQR
ClpMatrixBase | Abstract base class for Clp Matrices
ClpDummyMatrix | This implements a dummy matrix as derived from ClpMatrixBase
ClpNetworkMatrix | This implements a simple network matrix as derived from ClpMatrixBase
ClpPackedMatrix |
ClpDynamicMatrix | This implements a dynamic matrix when we have a limit on the number of "interesting rows"
ClpDynamicExampleMatrix | This implements a dynamic matrix when we have a limit on the number of "interesting rows"
ClpGubMatrix | This implements Gub rows plus a ClpPackedMatrix
ClpGubDynamicMatrix | This implements Gub rows plus a ClpPackedMatrix
ClpPlusMinusOneMatrix | This implements a simple +- one matrix as derived from ClpMatrixBase
ClpModel |
ClpInterior | This solves LPs using interior point methods
ClpPdco | This solves problems in Primal Dual Convex Optimization
ClpPredictorCorrector | This solves LPs using the predictor-corrector method due to Mehrotra
ClpSimplex | This solves LPs using the simplex method
AbcSimplex |
AbcSimplexDual | This solves LPs using the dual simplex method
AbcSimplexPrimal | This solves LPs using the primal simplex method
ClpSimplexDual | This solves LPs using the dual simplex method
ClpSimplexOther | This is for Simplex stuff which is neither dual nor primal
ClpSimplexPrimal | This solves LPs using the primal simplex method
ClpSimplexNonlinear | This solves non-linear LPs using the primal simplex method
ClpNetworkBasis | This deals with Factorization and Updates for network structures
ClpNode |
ClpNodeStuff |
ClpNonLinearCost |
ClpObjective | Objective Abstract Base Class
ClpLinearObjective | Linear Objective Class
ClpQuadraticObjective | Quadratic Objective Class
ClpPackedMatrix2 |
ClpPackedMatrix3 |
ClpPdcoBase | Abstract base class for tailoring everything for Pcdo
myPdco | This implements a simple network matrix as derived from ClpMatrixBase
ClpPresolve | This is the Clp interface to CoinPresolve
ClpPrimalColumnPivot | Primal Column Pivot Abstract Base Class
ClpPrimalColumnDantzig | Primal Column Pivot Dantzig Algorithm Class
ClpPrimalColumnSteepest | Primal Column Pivot Steepest Edge Algorithm Class
ClpPrimalQuadraticDantzig | Primal Column Pivot Dantzig Algorithm Class
ClpSimplexProgress | For saving extra information to see if looping
ClpSolve | This is a very simple class to guide algorithms
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
CoinAbcTypeFactorization |
CoinAbcStack |
CoinAbcStatistics |
CoinAbsFltEq | Equality to an absolute tolerance
CoinArrayWithLength | Pointer with length in bytes
CoinArbitraryArrayWithLength | Arbitrary version
CoinBigIndexArrayWithLength | CoinBigIndex * version
CoinDoubleArrayWithLength | Double * version
CoinFactorizationDoubleArrayWithLength | CoinFactorizationDouble * version
CoinFactorizationLongDoubleArrayWithLength | CoinFactorizationLongDouble * version
CoinIntArrayWithLength | Int * version
CoinUnsignedIntArrayWithLength | Unsigned int * version
CoinVoidStarArrayWithLength | Void * version
CoinBaseModel |
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
CoinStructuredModel |
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
CglLandP::NoBasisError |
CglLandP::SimplexInterfaceError |
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
CoinFileIOBase | Base class for FileIO classes
CoinFileInput | Abstract base class for file input 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
CoinLpIO::CoinHashLink |
CoinMpsIO::CoinHashLink |
ClpHashValue::CoinHashLink | Data
CoinIndexedVector | Indexed Vector
CoinPartitionedVector |
LAP::TabRow |
CoinLpIO | Class to read and write Lp files
CoinMessageHandler | Base class for message handling
MyMessageHandler |
CoinMessages | Class to hold and manipulate an array of massaged messages
AbcMessage |
AlpsMessage |
BcpsMessage |
BlisMessage |
BlisMessage |
CglMessage | This deals with Cgl messages (as against Osi messages etc)
ClpMessage | This deals with Clp messages (as against Osi messages etc)
CoinMessage | The standard set of Coin messages
LAP::LandPMessages | Message handler for lift-and-project simplex
LAP::LapMessages | Output messages for Cgl
CoinModelHash |
CoinModelHash2 | For int,int hashing
CoinModelHashLink | For names and hashing
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
CoinOtherFactorization | Abstract base class which also has some scalars so can be used from Dense or Simp
CoinDenseFactorization | This deals with Factorization and Updates This is a simple dense version so other people can write a better one
CoinOslFactorization |
CoinSimpFactorization |
CoinSnapshot::coinOwned | To say whether arrays etc are owned by CoinSnapshot
CoinPackedMatrix | Sparse Matrix Base Class
CoinPackedVectorBase | Abstract base class for various sparse vectors
CoinPackedVector | Sparse Vector
CoinShallowPackedVector | Shallow Sparse Vector
CoinPair< S, T > | An ordered pair
CoinParam | A base class for `keyword value' command line parameters
CoinPrePostsolveMatrix | Collects all the information about the problem that is needed in both presolve and postsolve
CoinPostsolveMatrix | Augments CoinPrePostsolveMatrix with information about the problem that is only needed during postsolve
CoinPresolveMatrix | Augments CoinPrePostsolveMatrix with information about the problem that is only needed during presolve
CoinPresolveAction | Abstract base class of all presolve routines
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
dupcol_action | Detect and remove duplicate columns
duprow3_action |
duprow_action | Detect and remove duplicate rows
forcing_constraint_action | Detect and process forcing constraints and useless constraints
gubrow_action | Detect and remove entries whose sum is known
implied_free_action | Detect and process implied free variables
isolated_constraint_action |
make_fixed_action | Fix a variable at a specified bound
remove_dual_action | Attempt to fix variables by bounding reduced costs
remove_fixed_action | Excise fixed variables from the model
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
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 |
CoinPresolveMonitor | Monitor a row or column for modification
CoinRational |
CoinRelFltEq | Equality to a scaled tolerance
CoinSearchTreeBase |
CoinSearchTree< Comp > |
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
CoinSosSet | Very simple class for containing SOS set
CoinSnapshot | NON Abstract Base Class for interfacing with cut generators or branching code or
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 > |
CoinWarmStart | Abstract base class for warm start information
CoinWarmStartBasis | The default COIN simplex (basis-oriented) warm start class
AbcWarmStart |
CoinWarmStartDual | WarmStart information that is only a dual vector
CoinWarmStartPrimalDual | WarmStart information that is only a dual vector
CoinWarmStartVector< T > | WarmStart information that is only a vector
CoinWarmStartVector< double > |
CoinWarmStartVector< U > |
CoinWarmStartVectorPair< T, U > |
CoinWarmStartDiff | Abstract base class for warm start `diff' objects
CoinWarmStartBasisDiff | A `diff' between two CoinWarmStartBasis objects
CoinWarmStartDualDiff | A `diff' between two CoinWarmStartDual objects
CoinWarmStartPrimalDualDiff | A `diff' between two CoinWarmStartPrimalDual objects
CoinWarmStartVectorDiff< T > | A `diff' between two CoinWarmStartVector objects
CoinWarmStartVectorDiff< double > |
CoinWarmStartVectorDiff< U > |
CoinWarmStartVectorPairDiff< T, U > |
CoinYacc |
OsiCuts::const_iterator | Const Iterator
cut |
cut_list |
cutParams |
LAP::Cuts | To store extra cuts generated by columns from which they origin
cycle |
cycle_list |
DeletePtrObject |
DGG_constraint_t |
DGG_data_t |
DGG_list_t |
CglProbing::disaggregation_struct_tag | Disaggregation cuts and for building cliques
disaggregationAction | Only useful type of disaggregation is most normal For now just done for 0-1 variables Can be used for building cliques
dropped_zero | Tracking information for an explicit zero coefficient
dualColumnResult |
EDGE |
edge |
EDGE_DATA |
EKKHlink | This deals with Factorization and Updates This is ripped off from OSL!!!!!!!!!
ELIST |
FactorPointers | Pointers used during factorization
CglClique::fnode | A node of the fractional graph
CglClique::frac_graph | A graph corresponding to a fractional solution of an LP
glp_prob |
Idiot | This class implements a very silly algorithm
IdiotResult | For use internally
ilp |
Info | ******** DATA to be moved into protected section of ClpInterior
info_weak |
OsiCuts::iterator | Iterator
list |
OsiUnitTest::TestOutcomes | Utility class to maintain a list of test outcomes
log_var |
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
OsiBranchingInformation |
OsiBranchingObject | Abstract branching object base class
OsiTwoWayBranchingObject | This just adds two-wayness to a branching object
OsiIntegerBranchingObject | Simple branching object for an integer variable
OsiLotsizeBranchingObject | Lotsize branching object
OsiSOSBranchingObject | Branching object for Special ordered sets
OsiChooseVariable | This class chooses a variable to branch on
OsiChooseStrong | This class chooses a variable to branch on
OsiCut |
OsiColCut | Column Cut Class
OsiRowCut | Row Cut Class
OsiRowCut2 | Row Cut Class which refers back to row which created it
OsiCuts::OsiCutCompare |
OsiCuts | Collections of row cuts and column cuts
OsiHotInfo | This class contains the result of strong branching on a variable When created it stores enough information for strong branching
OsiObject | Abstract base class for `objects'
OsiObject2 | Define a class to add a bit of complexity to OsiObject This assumes 2 way branching
OsiLotsize | Lotsize class
OsiSimpleInteger | Define a single integer class
OsiSOS | Define Special Ordered Sets of type 1 and 2
OsiPresolve | OSI interface to COIN problem simplification capabilities
BlisPresolve | A interface to Osi/Coin Presolve
OsiPseudoCosts | This class is the placeholder for the pseudocosts used by OsiChooseStrong
OsiRowCutDebugger | Validate cuts against a known solution
OsiSolverBranch | Solver Branch Class
OsiSolverInterface | Abstract Base Class for describing an interface to a solver
OsiClpSolverInterface | Clp Solver Interface
OsiCpxSolverInterface | CPLEX Solver Interface
OsiGlpkSolverInterface |
OsiGrbSolverInterface | Gurobi Solver Interface
OsiMskSolverInterface |
OsiSpxSolverInterface | SoPlex Solver Interface Instantiation of OsiSpxSolverInterface for SoPlex
OsiTestSolverInterface | Vol(ume) Solver Interface
OsiXprSolverInterface | XPRESS-MP Solver Interface
OsiSolverResult | Solver Result Class
OsiTestSolverInterface::OsiVolMatrixOneMinusOne_ |
Outfo | ******** DATA to be moved into protected section of ClpInterior
ClpSimplexOther::parametricsData |
parity_ilp |
AbcSimplexPrimal::pivotStruct |
pool_cut |
pool_cut_list |
presolvehlink | Links to aid in packed matrix modification
Coin::ReferencedObject | ReferencedObject class
ROUTE_DATA |
scatterStruct |
select_cut |
separation_graph |
short_path_node |
SMALL_GRAPH |
Coin::SmartPtr< T > | Template class for Smart Pointers
symrec | For string evaluation
OsiUnitTest::TestOutcome | A single test outcome record
unary_function |
TotalWorkload | A functor class used in calulating total workload in a node pool
LAP::Validator | Class to validate or reject a cut
VERTEX |
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
OsiTestSolverInterface | Vol(ume) Solver Interface
VOL_vh |
VrpNetwork |