| _EKKfactinfo | |
| doubleton_action::action | |
| dupcol_action::action | |
| duprow_action::action | |
| gubrow_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 | |
| OsiSolverInterface::ApplyCutsReturnCode | Internal class for obtaining status from the applyCuts method |
| MCF2_data::arc | |
| MCF1_data::arc | |
| MCF3_data::arc | |
| BB_cut | Simple representation of a cut by storing non zero coefficients only |
| BB_indexed_cut | When doing a sprint sort of algorithm on the cuts (i.e., leave out a number of cuts at the beginning and add them only as necessary) this object represents one of these cuts |
| BB_init | |
| BB_lp | Class for operations at the node level |
| BB_packer | Class taking care of packing/unpacking |
| BB_prob | Class holding data for describing the problem |
| BB_tm | |
| BCP_buffer | This class describes the message buffer used for all processes of BCP |
| BCP_cg_par | Parameters used in the Cut Generator process |
| BCP_cg_prob | This class is the central class of the Cut Generator process |
| BCP_cg_user | Base class from which the user can derive a problem specific class to be used in the Cut Generator process |
| BCP_col | This class holds a column in a compressed form |
| BCP_cut | Abstract base class that defines members common to all types of cuts |
| BCP_cut_algo | This is the class from which the user should derive her own algorithmic cuts |
| BCP_cut_core | Core cuts are the cuts that always stay in the LP formulation |
| BCP_cut_set | This class is just a collection of pointers to cuts with a number of methods to manipulate these cuts and/or select certain entries |
| BCP_fatal_error | Currently there isn't any error handling in BCP |
| BCP_internal_brobj | This class is the internal representation of a branching object |
| BCP_lp_branching_object | This class describes a generic branching object |
| BCP_lp_cut_pool | |
| BCP_lp_integer_branching_object | This class exist only so that we can extract information from OsiIntegerBranchingObject |
| BCP_lp_node | NO OLD DOC |
| BCP_lp_par | Parameters used in the LP process |
| BCP_lp_parent | NO OLD DOC |
| BCP_lp_prob | NO OLD DOC |
| BCP_lp_relax | An object of type BCP_lp_relax holds the description of an lp relaxation |
| BCP_lp_result | This class holds the results after solving an LP relaxation |
| BCP_lp_sos_branching_object | This class exist only so that we can extract information from OsiIntegerBranchingObject |
| BCP_lp_statistics | NO OLD DOC |
| BCP_lp_user | Base class from which the user can derive a problem specific class to be used in the LP process |
| BCP_lp_var_pool | |
| BCP_lp_waiting_col | |
| BCP_lp_waiting_row | |
| BCP_MemPool | |
| BCP_message_environment | This is an abstract base class that describes the message passing environment |
| BCP_node_change | |
| BCP_node_storage_in_tm | NO OLD DOC |
| BCP_obj_change | |
| BCP_obj_set_change | This class stores data about how an object set (set of vars or set of cuts) changes |
| BCP_parameter | This parameter indeintifies a single parameter entry |
| BCP_parameter_set< Par > | This is the class serves as a holder for a set of parameters |
| BCP_presolved_lp_brobj | A presolved branching object candidate |
| BCP_problem_core | This class describes the core of the MIP problem, the variables/cuts in it as well as the matrix corresponding the core variables and cuts |
| BCP_problem_core_change | This class describes changes in the core of the problem |
| BCP_process | |
| BCP_row | This class holds a row in a compressed form |
| BCP_scheduler | |
| BCP_single_environment | |
| BCP_slave_params | NO OLD DOC |
| BCP_solution | This is the abstract base class for a solution to a Mixed Integer Programming problem |
| BCP_solution_generic | This class holds a MIP feasible primal solution |
| BCP_string | This class is a very simple impelementation of a constant length string |
| BCP_tm_flags | NO OLD DOC |
| BCP_tm_node | |
| BCP_tm_node_data | |
| BCP_tm_node_to_send | |
| BCP_tm_par | Parameters used in the Tree Manager process |
| BCP_tm_prob | NO OLD DOC |
| BCP_tm_stat | |
| BCP_tm_user | Base class from which the user can derive a problem specific class to be used in the TM process |
| BCP_tree | NO OLD DOC |
| BCP_ts_node_data | Same as BCP_tm_node_data, just there's no need to use smart pointers in this process |
| BCP_ts_par | |
| BCP_ts_prob | |
| BCP_ts_user | |
| BCP_user_class | |
| BCP_user_data | |
| BCP_user_pack | |
| BCP_var | Abstract base class that defines members common to all types of variables |
| BCP_var_algo | This is the class from which the user should derive her own algorithmic variables |
| BCP_var_core | Core variables are the variables that always stay in the LP formulation |
| BCP_var_set | This class is just a collection of pointers to variables with a number of methods to manipulate these variables and/or select certain entries |
| BCP_vec< T > | The class BCP_vec serves the same purpose as the vector class in the standard template library |
| BCP_vec_change< T > | This class stores a vector explicitly or relatively to another vector |
| BCP_vg_par | |
| BCP_vg_prob | This class is the central class of the Variable Generator process |
| BCP_vg_user | Base class from which the user can derive a problem specific class to be used in the Cut Generator process |
| BCP_warmstart | Warmstarting information for the LP solver |
| BCP_warmstart_basis | This class describes a warmstart information that consists of basis information for structural and artificial variables |
| BCP_warmstart_dual | This class describes a warmstart information that consists solely of the dual vector |
| BCP_warmstart_primaldual | This class describes a warmstart information that consists solely of the dual vector |
| BitVector128 | |
| blockStruct | |
| 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 |
| 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 |
| CglGomory | Gomory Cut Generator Class |
| 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() |
| 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 |
| 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 |
| Cname | |
| CoinAbsFltEq | Equality to an absolute tolerance |
| 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 |
| 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 |
| 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 |
| 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 |
| 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 | |
| MCF2_data::commodity | |
| MCF3_data::commodity | |
| MCF1_data::commodity | |
| OsiCuts::const_iterator | Const Iterator |
| cutParams | |
| LAP::Cuts | To store extra cuts generated by columns from which they origin |
| 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 |
| dupcol_action | Detect and remove duplicate columns |
| duprow_action | Detect and remove duplicate rows |
| 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 |
| implied_free_action | Detect and process implied free variables |
| Info | ******** DATA to be moved into protected section of ClpInterior |
| isolated_constraint_action | |
| OsiCuts::iterator | Iterator |
| LAP::LandPMessages | Message handler for lift-and-project simplex |
| LAP::LapMessages | Output messages for Cgl |
| LP_data_and_hook | |
| LP_parms | |
| make_fixed_action | Fix a variable at a specified bound |
| MC_adjacency_entry | |
| MC_cycle_cut | |
| MC_explicit_dense_cut | |
| MC_feas_sol | |
| MC_graph_edge | |
| MC_graph_node | |
| MC_initialize | |
| MC_lp | |
| MC_lp_par | |
| MC_packer | |
| MC_path_adj_entry | |
| MC_path_node | |
| MC_path_node_ptr_compare | |
| MC_problem | |
| MC_solution | |
| MC_switch_structure | |
| MC_tm | |
| MC_tm_par | |
| MCF1_branch_decision | |
| MCF1_branching_var | |
| MCF1_data | |
| MCF1_init | |
| MCF1_lp | |
| MCF1_packer | |
| MCF1_par | |
| MCF1_tm | |
| MCF1_var | |
| MCF2_branch_decision | |
| MCF2_branching_var | |
| MCF2_data | |
| MCF2_init | |
| MCF2_lp | |
| MCF2_packer | |
| MCF2_par | |
| MCF2_tm | |
| MCF2_var | |
| MCF3_branch_decision | |
| MCF3_data | |
| MCF3_init | |
| MCF3_lp | |
| MCF3_packer | |
| MCF3_par | |
| MCF3_tm | |
| MCF3_user | |
| MCF3_var | |
| MY_user_data | Class taking care of interaction between user data and Bcp |
| 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_ | |
| OsiVolSolverInterface::OsiVolMatrixOneMinusOne_ | |
| OsiVolSolverInterface | Vol(ume) Solver Interface |
| OsiXprSolverInterface | XPRESS-MP Solver Interface |
| Outfo | ******** DATA to be moved into protected section of ClpInterior |
| CglLandP::Parameters | Class storing parameters |
| presolvehlink | Links to aid in packed matrix modification |
| real_user_data | Class handling user data |
| Coin::ReferencedObject | ReferencedObject class |
| remove_dual_action | Attempt to fix variables by bounding reduced costs |
| remove_fixed_action | Excise fixed variables from the model |
| Rname | |
| 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 | |
| symrec | For string evaluation |
| LAP::TabRow | |
| OsiUnitTest::TestOutcome | A single test outcome record |
| OsiUnitTest::TestOutcomes | Utility class to maintain a list of test outcomes |
| tripleton_action | We are only going to do this if it does not increase number of elements? |
| UFL | |
| UFL_parms | |
| useless_constraint_action | |
| USER_initialize | This class is an abstract base class for the initializer class the user has to provide |
| 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_lp | |
| 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 | |
