| 
    solver
    1.0
    
   | 
 
| ▼CActivity | The base class incorporating common properties of robot operations and movements | 
| CDynamicActivity | Collection of movements between two static activities | 
| CStaticActivity | Collection of locations in which a robot operation (or waiting) can be performed | 
| ▼CActivityMode | Either a movement or location | 
| CLocation | Location of the robot used either during work (welding) or waiting | 
| CMovement | The instance of the class corresponds to a robot movement between two coordinates | 
| CActivityModeInfo | Structure encapsulates the time and energy properties of an activity with its selected mode (a movement or location) | 
| CCircuitRecord | Shortest closed path through locations | 
| CCircuitTuple | A partially fixed problem, i.e. tuple | 
| CCollisionResolution | The structure stores how to resolve one collision between robots | 
| CConstraintsGenerator | Generation of the (I)LP constraints | 
| CEdge | A graph edge in the distance graph | 
| CTabuList::Element | An element of the tabu list | 
| ▼Cstd::exception | STL class | 
| ▼CSolverException | A general exception of the program | 
| CEmptySolutionPool | Thrown if the best solution of the heuristic cannot be returned since the solution pool is empty | 
| CILPSolverException | Exception dedicated to problems with Integer Linear Programming solvers | 
| CInvalidArgument | Exception is thrown if a method is given invalid parameters or a user provides invalid program arguments | 
| CInvalidDatasetFile | Thrown if the dataset file contains ill-specified robotic cells | 
| CNoFeasibleSolutionExists | Thrown if no feasible solution is found by the heuristic | 
| CGraph | A graph in which random alternatives will be searched for | 
| CHamiltonianCircuit< T > | Closed path through locations or static activities including an order of operations, i.e. alternative | 
| CHamiltonianCircuit< Location > | |
| Cstd::hash< pair< Location *, Location * > > | Template specialization of the hash for a pair of Location pointers | 
| Cstd::hash< pair< uint32_t, uint32_t > > | Template specialization of the hash for a pair of uint32_t | 
| Cstd::hash< ShortestCircuit > | Template specialization of the hash for the ShortestCircuit data-structure | 
| CHeuristicAlgorithms | Defines the optimization part of the parallel heuristic, i.e. sub-heuristics and the evaluation of tuples | 
| CILPModel | Integer Linear Programming problem is stored in this data structure | 
| CInstanceChecker | An instance of this class checks a dataset instance | 
| CInstancesReader | The class is intended to be used by users for the dataset parsing and checking | 
| CInterRobotOperation | The inter-robot operation corresponding to the workpiece/weldment handling | 
| CKnowledgeBase | Protected access to the shared data of the threads of the parallel heuristic | 
| CLocationDependentPowerConsumption | The instance of this class specifies input power of the robot for a particular robot configuration and power saving mode | 
| CModeSwitchInfo | Records a potential energy impact if a power saving mode of a robot is switched to another one | 
| CMonomial | A part of the energy function of a movement | 
| CMovingAverage< T > | The class encapsulating the calculation of the moving average | 
| COptimalTiming | Obtained timing for a partial problem | 
| CParallelHeuristicSolver | A parallel heuristic for the energy optimization of robotic cells | 
| CPartialSolution | Fixed locations, power saving modes, and movements | 
| CPrecalculatedMapping | The structure contains the maps for fast searching in the robotic cell | 
| CRobot | Instance of this class includes all the data structures and methods related to a robot | 
| CRoboticLine | The robotic cell corresponds to an instance of this class | 
| CRoboticLineSolverILP | An exact solver for the energy optimization problem | 
| CRoboticLineSolverLP | Determines an optimal timing of a partially fixed problem | 
| CRobotPowerMode | It represents the power saving mode of the robot | 
| CShortestCircuit | Hamiltonian circuit through static activities and the fixed locations | 
| CSolution | The structure representing a solution found by an algorithm | 
| CSolutionChecker | An instance of this class is devoted to the solution checking | 
| CSolutionILP | Structure storing a solution of an Integer Linear Programming problem | 
| CSparseMatrix< T > | Memory efficient storage of the constraint matrix | 
| CSparseMatrix< double > | |
| CTabuList | A short-term memory, containing a list of forbidden moves, that mitigates the risk of cycling | 
| CTimeLag | Instance of TimeLag class defines a time relation between two different robots | 
| CUnimodalFunctionHeuristic | An unimodal function for two movements and their fixed total time | 
| CVariable | Structure containing information about the variable | 
| ▼CVariableMappingLP | Mapping of continuous variables occurring in the energy optimization problem | 
| CVariableMappingILP | Mapping of continuous and binary variables | 
| CXmlReader | Parser of XML datasets | 
 1.8.9.1