_EKKfactinfo | |
AbcBranchDecision | Abstract branching decision base class |
AbcBranchDefaultDecision | Branching decision default class |
AbcCutGenerator | Interface between Abc and Cut Generation Library |
AbcDualRowDantzig | Dual Row Pivot Dantzig Algorithm Class |
AbcDualRowPivot | Dual Row Pivot Abstract Base Class |
AbcDualRowSteepest | Dual Row Pivot Steepest Edge Algorithm Class |
AbcHeuristic | Heuristic base class |
AbcMatrix | |
AbcMatrix2 | |
AbcMatrix3 | |
AbcMessage | |
AbcModel | Model class for ALPS Branch and Cut |
AbcNodeDesc | |
AbcNonLinearCost | |
AbcParams | |
AbcPrimalColumnDantzig | Primal Column Pivot Dantzig Algorithm Class |
AbcPrimalColumnPivot | Primal Column Pivot Abstract Base Class |
AbcPrimalColumnSteepest | Primal Column Pivot Steepest Edge Algorithm Class |
AbcPseudocost | |
AbcRounding | Rounding 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 |
AbcSolution | This class holds a MIP feasible primal solution |
AbcTolerancesEtc | |
AbcTreeNode | |
AbcWarmStart | |
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 |
AlpsKnowledgeBroker | The base class of knowledge broker class |
AlpsKnowledgeBrokerMPI | |
AlpsKnowledgeBrokerSerial | |
AlpsKnowledgePool | |
AlpsMessage | |
AlpsModel | |
AlpsNodeDesc | A class to refer to the description of a search tree node |
AlpsNodePool | Node pool is used to store the nodes to be processed |
AlpsNodeSelection | |
AlpsNodeSelectionBest | |
AlpsNodeSelectionBreadth | |
AlpsNodeSelectionDepth | |
AlpsNodeSelectionEstimate | |
AlpsNodeSelectionHybrid | |
AlpsParameter | This parameter indeintifies a single parameter entry |
AlpsParameterSet | This is the class serves as a holder for a set of parameters |
AlpsParams | |
AlpsPriorityQueue< T > | |
AlpsSolution | |
AlpsSolutionPool | In the solution pool we assume that the lower the priority value the more desirable the solution is |
AlpsStrLess | A function object to perform lexicographic lexicographic comparison between two C style strings |
AlpsSubTree | This class contains the data pertaining to a particular subtree in the search tree |
AlpsSubTreePool | The subtree pool is used to store subtrees |
AlpsTimer | |
AlpsTreeNode | This class holds one node of the search tree |
AlpsTreeSelection | |
AlpsTreeSelectionBest | |
AlpsTreeSelectionBreadth | |
AlpsTreeSelectionDepth | |
AlpsTreeSelectionEstimate | |
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 |
BcpsBranchStrategy | Branching strategy specifies: (1) how to select a candidate set of branching objects (2) how to compare two branching objects |
BcpsConstraint | |
BcpsConstraintPool | |
BcpsFieldListMod< T > | This class contains modifications for a single std::vector<T> object |
BcpsMessage | |
BcpsModel | |
BcpsNodeDesc | For a given type, the objectVecStorage_ structure holds the description |
BcpsObject | A class for describing the objects that comprise a BCPS subproblem |
BcpsObjectListMod | Here is the set of vectorMod_ objects that represent the list of objects of a particular type (either in relative or explicit form) |
BcpsObjectPool | Object pool is used to store objects |
BcpsSolution | This class holds the solution objects |
BcpsSubTree | This class is the data structure for storing a subtree within BCPS |
BcpsTreeNode | This class contain the data for a BCPS search tree node |
BcpsVariable | |
BcpsVariablePool | |
BitVector128 | |
BlisBranchObjectInt | |
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 |
BlisBranchStrategyStrong | Blis branching strategy default class This class implements a simple default algorithm, betterBranchObject(), for choosing a branching variable |
BlisConGenerator | Interface between Blis and Cut Generation Library |
BlisConstraint | |
BlisHeuristic | Heuristic base class |
BlisHeurRound | Rounding Heuristic |
BlisMessage | |
BlisModel | |
BlisNodeDesc | |
BlisObjectInt | |
BlisParams | |
BlisPseudocost | |
BlisSolution | This class contains the solutions generated by the LP solver (either primal or dual |
BlisStrong | |
BlisTreeNode | This is the class in which we are finally able to concretely define the bounding procedure |
BlisVariable | |
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 | |
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 | |
LAP::CglLandPSimplex | |
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 |
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 |
CglKnapsackCover::CliqueType | Clique type |
CglProbing::CliqueType | Clique type |
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 |
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 |
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 |
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 |
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< T > | Dense Vector |
CoinDoubleArrayWithLength | Double * version |
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 |
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< 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 |
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 |
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 |
CoinSnapshot::coinOwned | To say whether arrays etc are owned by CoinSnapshot |
CoinPackedMatrix | Sparse Matrix Base Class |
CoinPackedVector | Sparse Vector |
CoinPackedVectorBase | Abstract base class for various sparse vectors |
CoinPair< S, T > | An ordered pair |
CoinParam | A base class for `keyword value' command line parameters |
CoinPartitionedVector | |
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< Comp > | |
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< S, T, U > | |
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< T > | WarmStart information that is only a vector |
CoinWarmStartVectorDiff< T > | A `diff' between two CoinWarmStartVector objects |
CoinWarmStartVectorPair< T, 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 |
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 |
CglClique::fnode | A node of the fractional graph |
forcing_constraint_action | Detect and process forcing constraints and useless constraints |
CglClique::frac_graph | A graph corresponding to a fractional solution of an LP |
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 | |
OsiCuts::iterator | Iterator |
KnapModel | |
KnapNodeDesc | |
KnapParams | |
KnapSolution | |
KnapTreeNode | |
LAP::LandPMessages | Message handler for lift-and-project simplex |
LAP::LapMessages | Output messages for Cgl |
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 |
CglLandP::NoBasisError | |
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 |
OsiChooseStrong | 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::OsiCutCompare | |
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 |
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 |
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 |
OsiSimpleInteger | Define a single integer class |
OsiSolverBranch | Solver Branch Class |
OsiSolverInterface | Abstract Base Class for describing an interface to a solver |
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 |
OsiTestSolverInterface::OsiVolMatrixOneMinusOne_ | |
OsiXprSolverInterface | XPRESS-MP Solver Interface |
Outfo | ******** DATA to be moved into protected section of ClpInterior |
CglLandP::Parameters | Class storing parameters |
ClpSimplexOther::parametricsData | |
parity_ilp | |
AbcSimplexPrimal::pivotStruct | |
pool_cut | |
pool_cut_list | |
presolvehlink | Links to aid in packed matrix modification |
Coin::ReferencedObject | ReferencedObject class |
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 | |
CglLandP::SimplexInterfaceError | |
slack_doubleton_action | Convert an explicit bound constraint to a column bound |
slack_singleton_action | For variables with one entry |
Coin::SmartPtr< T > | Template class for Smart Pointers |
subst_constraint_action | Detect and process implied free variables |
symrec | For string evaluation |
LAP::TabRow | |
OsiUnitTest::TestOutcome | A single test outcome record |
OsiUnitTest::TestOutcomes | Utility class to maintain a list of test outcomes |
TotalWorkload | A functor class used in calulating total workload in a node pool |
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 | |
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 | |