MineLink
 All Data Structures Functions Variables Pages
Data Structures
Here are the data structures with brief descriptions:
[detail level 12]
 Ndelphos
 CAccessibilityAndRangeFilterAbstracts the intersection of an Accessibility and a Range filter function
 CAccessibilityFilterAbstracts accessibility filter function
 CArcA class that abstracts a relation between two indexes that represent two block ids
 CAttributeAvgConstraintA constraint on the average values of attributes of blocks
 CAttributeSumConstraintA constraint on the addition of the attributes of a block
 CAxisRangeFilterAbstracts range filter function for axis
 CBenchByBenchPrecedenceDefines maximum difference in height between consecutive benches on the same phase
 CBenchPhaseDifferencePrecedenceDefines maximum difference in height between consecutive phase-bench
 CBlockA utility class to access blocks individually
 CBlockConstraintA base class for constraints that apply to subsets of blocks
 CBlockFilterAbstracts functions to do block selection
 CBlockModelAbstracts a container of blocks as a table with arbitrary number of attributes that can be accessed by index \((0, 1,\ldots, N-1)\) (where \(N\) is total number of blocks) or coordinates \((x,y,z)\)
 CBlockModelEntityA base class for object associated to a given block model
 CBlockSelectionAbstracts a set of blocks (subset of a blockmodel)
 CBlockSelectionPrecedenceConstraintA block selection precedence constraint
 CBlockTimingConstraintDefines a constraint that limits processing periods or destinations for blocks
 CBZDummy class that define required methods for a Bienstock Zuckerberg solver of a scheduling instance
 CBZHeuristicClass that defines heuristics that use expected times for blocks, computed by Bienstock Zuckerberg algorithm (BZ)
 CCBCBZA fractional Scheduler class based on Bienstock-Zuckerberg algorithm and CBC for solving its sub problems. this scheduler computes at each iteration a final pit and solve the lp relaxation of the original problem
 CCBCFractionalSchedulerAbstracts a CBC LP solver that can solve a scheduling instance
 CCBCMIPSchedulerAbstracts a CBC MIP solver that can solve a scheduling instance
 CCcolAbstracts a container of computed column
 CConstraintDefines the base class for all constraints
 CCoordinatesAn utility class to abstract coordinates so they can be used as map and set keys by means of string conversion
 CcoordindexStructure to store index coordinates for a block
 CDestinationDefines a destination or process
 CDictAbstact a dictionary to store and get attributes
 CDoNotMineBeforeConstraintA constraint limiting the period at which a block should be mined
 CDoNotSendToConstraintA constraint that prevents certain blocks to be sent to given processes
 CFinalPitInstanceDefines a case for the final pit problem
 CFinalPitSolverA dummy class that specifies the methods of an algorithm that can solve a final pit instance
 CForceMiningByConstraintA constraint that forces a block to be mined before or at some period
 CFractionalScheduleDefines a fractional scheduling of blocks
 CFractionalSchedulerDummy class that define required methods for a solver of a scheduling instance
 CFractionalScheduleToScheduleDummy class that define required methods for a fractional schedule to schedule heuristic that solve a scheduling instance
 CGeometricConstraintA geometric constraint
 CGurobiBZA fractional Scheduler class based on Bienstock-Zuckerberg algorithm and Gurobi for solving its sub problems. this scheduler computes at each iteration a final pit and solve the lp relaxation of the original problem
 CGurobiFractionalSchedulerAbstracts a Gurobi LP solver that can solve a scheduling instance
 CGurobiMIPSchedulerAbstracts a Gurobi MIP solver that can solve a scheduling instance
 CHRebClass that defines a twos phase Reblocking heuristic that solve a scheduling instance. First phase is a topological aggregation. The second phase is a topoligcal desaggregation that permit to obtain a feasible solution to original problem. This implementation of the heuristic is not working for a model that got multi fractional destination variables. If the scheduling instance has got the PCPSP flag on, an exception is thrown. This implementation of the heuristic is working only for a simple slope precedence. RampPrecedenceConstaint, sinking constraints, GeometricConstraint and BlockSelectionPrecedenceConstraint not implemented. Use of BlockSelection not null in all Constraints not implemented
 CMinCutGraphAn implementation of the graph used by the final pit solver based on the Pseudoflow algorithm to solve the min-cut problem
 CMineLinkExceptionAbstracts Exceptions for MineLink library. In Windows, Log File MineLink.log is gererally for a user_name user in "C:\\Users\\user_name\\AppData\\Local\\Temp" accessible from console
 CMinExtractPeriodConstraintA constraint that prevents certain blocks that can't be extracted before a period due to capacities constraints, to be used
 CMIPSchedulerDummy class that define required methods for a MIP solver of a scheduling instance
 CNestedPitInstanceDefines a case for the nested pits problem
 CNestedPitsDefines nested pits
 CNestedPitSolverA dummy class that specifies the methods of an algorithm that can solve a nested pit instance
 CNewmanHeuristicClass that defines a sliding time window heuristic with lagrangean relaxion that solve a scheduling instance
 CPrecedenceImplements a precedence as an explicit set of arcs between blocks. Provides utility functions
 CPrecedenceConstraintA precedence constraint
 CPseudoFlowFinalPitSolverAn implementation of a final pit solver based on the Pseudoflow algorithm
 CPseudoFlowNestedPitSolverAn implementation of a nested pit solver based on the Pseudoflow algorithm
 CRampPrecedenceHorizontal precedence class with utility methods
 CRangeFilterAbstracts range filter function
 CRankedFractionalScheduleToScheduleDummy class that define required methods for a ranked fractional schedule to schedule heuristic that solve a scheduling instance
 CReblockerAbstract class to define methods for the reblocking utility
 CRegularReblockerAn implementation of a reblocker based on regular dimensions and attribute filters
 CrelcoordindexStructure to store index coordinates for a block
 CRosettaSlopeThis class allows to store different slope angles depending on azimuth
 CScheduleDefines a scheduling of blocks
 CSchedulerDummy class that define required methods for a solver of a scheduling instance
 CSchedulingHeuristicDummy class that define required methods for a heuristic that solve a scheduling instance
 CSchedulingInstanceDefines a scheduling instance to be solved
 CSelectionAvgAbstracts average-type functions to be evaluated over a set of blocks
 CSelectionFunctorAbstract class that defines the basis for classes that abstracts functions to perform selections
 CSelectionMajorAbstracts a function to perform statistical mode
 CSelectionMaxAbstracts the maximum function to be evaluated over a set of blocks
 CSelectionMinAbstracts the minimum function to be evaluated over a set of blocks
 CSelectionSumAbstracts a sum function to be evaluated over a set of blocks
 CSlidingTimeWindowHeuristicClass that defines sliding time window heuristic that solve a scheduling instance
 CSlidingTimeWindowHeuristicRelaxedClass that defines relaxed sliding time window heuristic that solve a scheduling instance
 CSlopeDefinitionThis class defines a slope precedence
 CSlopePrecedenceVertical precedence class with utility methods for constant slope precedences
 CStockDefines a pre-existing stock
 CTimedConstraintA base class for constraints indexed by time-period
 CTopoHeuristicClass that defines a modified Topological sort heuristic that solve a scheduling instance. Only PrecedenceConstraint and AttributeSumConstraint are supported. Use of BlockSelection not null in Constraints not implemented. An attempt of considering AttributeAvgConstraint is implemented