▼Ndelphos | |
CAccessibilityAndRangeFilter | Abstracts the intersection of an Accessibility and a Range filter function |
CAccessibilityFilter | Abstracts accessibility filter function |
CArc | A class that abstracts a relation between two indexes that represent two block ids |
CAttributeAvgConstraint | A constraint on the average values of attributes of blocks |
CAttributeSumConstraint | A constraint on the addition of the attributes of a block |
CAxisRangeFilter | Abstracts range filter function for axis |
CBenchByBenchPrecedence | Defines maximum difference in height between consecutive benches on the same phase |
CBenchPhaseDifferencePrecedence | Defines maximum difference in height between consecutive phase-bench |
CBlock | A utility class to access blocks individually |
CBlockConstraint | A base class for constraints that apply to subsets of blocks |
CBlockFilter | Abstracts functions to do block selection |
CBlockModel | Abstracts 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)\) |
CBlockModelEntity | A base class for object associated to a given block model |
CBlockSelection | Abstracts a set of blocks (subset of a blockmodel) |
CBlockSelectionPrecedenceConstraint | A block selection precedence constraint |
CBlockTimingConstraint | Defines a constraint that limits processing periods or destinations for blocks |
CBZ | Dummy class that define required methods for a Bienstock Zuckerberg solver of a scheduling instance |
CBZHeuristic | Class that defines heuristics that use expected times for blocks, computed by Bienstock Zuckerberg algorithm (BZ) |
CCBCBZ | A 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 |
CCBCFractionalScheduler | Abstracts a CBC LP solver that can solve a scheduling instance |
CCBCMIPScheduler | Abstracts a CBC MIP solver that can solve a scheduling instance |
CCcol | Abstracts a container of computed column |
CConstraint | Defines the base class for all constraints |
CCoordinates | An utility class to abstract coordinates so they can be used as map and set keys by means of string conversion |
Ccoordindex | Structure to store index coordinates for a block |
CDestination | Defines a destination or process |
CDict | Abstact a dictionary to store and get attributes |
CDoNotMineBeforeConstraint | A constraint limiting the period at which a block should be mined |
CDoNotSendToConstraint | A constraint that prevents certain blocks to be sent to given processes |
CFinalPitInstance | Defines a case for the final pit problem |
CFinalPitSolver | A dummy class that specifies the methods of an algorithm that can solve a final pit instance |
CForceMiningByConstraint | A constraint that forces a block to be mined before or at some period |
CFractionalSchedule | Defines a fractional scheduling of blocks |
CFractionalScheduler | Dummy class that define required methods for a solver of a scheduling instance |
CFractionalScheduleToSchedule | Dummy class that define required methods for a fractional schedule to schedule heuristic that solve a scheduling instance |
CGeometricConstraint | A geometric constraint |
CGurobiBZ | A 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 |
CGurobiFractionalScheduler | Abstracts a Gurobi LP solver that can solve a scheduling instance |
CGurobiMIPScheduler | Abstracts a Gurobi MIP solver that can solve a scheduling instance |
CHReb | Class 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 |
CMinCutGraph | An implementation of the graph used by the final pit solver based on the Pseudoflow algorithm to solve the min-cut problem |
CMineLinkException | Abstracts 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 |
CMinExtractPeriodConstraint | A constraint that prevents certain blocks that can't be extracted before a period due to capacities constraints, to be used |
CMIPScheduler | Dummy class that define required methods for a MIP solver of a scheduling instance |
CNestedPitInstance | Defines a case for the nested pits problem |
CNestedPits | Defines nested pits |
CNestedPitSolver | A dummy class that specifies the methods of an algorithm that can solve a nested pit instance |
CNewmanHeuristic | Class that defines a sliding time window heuristic with lagrangean relaxion that solve a scheduling instance |
CPrecedence | Implements a precedence as an explicit set of arcs between blocks. Provides utility functions |
CPrecedenceConstraint | A precedence constraint |
CPseudoFlowFinalPitSolver | An implementation of a final pit solver based on the Pseudoflow algorithm |
CPseudoFlowNestedPitSolver | An implementation of a nested pit solver based on the Pseudoflow algorithm |
CRampPrecedence | Horizontal precedence class with utility methods |
CRangeFilter | Abstracts range filter function |
CRankedFractionalScheduleToSchedule | Dummy class that define required methods for a ranked fractional schedule to schedule heuristic that solve a scheduling instance |
CReblocker | Abstract class to define methods for the reblocking utility |
CRegularReblocker | An implementation of a reblocker based on regular dimensions and attribute filters |
Crelcoordindex | Structure to store index coordinates for a block |
CRosettaSlope | This class allows to store different slope angles depending on azimuth |
CSchedule | Defines a scheduling of blocks |
CScheduler | Dummy class that define required methods for a solver of a scheduling instance |
CSchedulingHeuristic | Dummy class that define required methods for a heuristic that solve a scheduling instance |
CSchedulingInstance | Defines a scheduling instance to be solved |
CSelectionAvg | Abstracts average-type functions to be evaluated over a set of blocks |
CSelectionFunctor | Abstract class that defines the basis for classes that abstracts functions to perform selections |
CSelectionMajor | Abstracts a function to perform statistical mode |
CSelectionMax | Abstracts the maximum function to be evaluated over a set of blocks |
CSelectionMin | Abstracts the minimum function to be evaluated over a set of blocks |
CSelectionSum | Abstracts a sum function to be evaluated over a set of blocks |
CSlidingTimeWindowHeuristic | Class that defines sliding time window heuristic that solve a scheduling instance |
CSlidingTimeWindowHeuristicRelaxed | Class that defines relaxed sliding time window heuristic that solve a scheduling instance |
CSlopeDefinition | This class defines a slope precedence |
CSlopePrecedence | Vertical precedence class with utility methods for constant slope precedences |
CStock | Defines a pre-existing stock |
CTimedConstraint | A base class for constraints indexed by time-period |
CTopoHeuristic | Class 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 |