This parameter indicates if the solver should compress the trail
during the search. No compression means that the solver will be faster,
but will use more memory.
This parameter indicates if the solver should compress the trail
during the search. No compression means that the solver will be faster,
but will use more memory.
Control the implementation of the table constraint.
bool use_small_table = 101;
Returns:
The useSmallTable.
getUseCumulativeEdgeFinder
booleangetUseCumulativeEdgeFinder()
Control the propagation of the cumulative constraint.
bool use_cumulative_edge_finder = 105;
Returns:
The useCumulativeEdgeFinder.
getUseCumulativeTimeTable
booleangetUseCumulativeTimeTable()
bool use_cumulative_time_table = 106;
Returns:
The useCumulativeTimeTable.
getUseCumulativeTimeTableSync
booleangetUseCumulativeTimeTableSync()
bool use_cumulative_time_table_sync = 112;
Returns:
The useCumulativeTimeTableSync.
getUseSequenceHighDemandTasks
booleangetUseSequenceHighDemandTasks()
bool use_sequence_high_demand_tasks = 107;
Returns:
The useSequenceHighDemandTasks.
getUseAllPossibleDisjunctions
booleangetUseAllPossibleDisjunctions()
bool use_all_possible_disjunctions = 108;
Returns:
The useAllPossibleDisjunctions.
getMaxEdgeFinderSize
intgetMaxEdgeFinderSize()
int32 max_edge_finder_size = 109;
Returns:
The maxEdgeFinderSize.
getDiffnUseCumulative
booleangetDiffnUseCumulative()
Control the propagation of the diffn constraint.
bool diffn_use_cumulative = 110;
Returns:
The diffnUseCumulative.
getUseElementRmq
booleangetUseElementRmq()
Control the implementation of the element constraint.
bool use_element_rmq = 111;
Returns:
The useElementRmq.
getSkipLocallyOptimalPaths
booleangetSkipLocallyOptimalPaths()
Skip locally optimal pairs of paths in PathOperators. Setting this
parameter to true might skip valid neighbors if there are constraints
linking paths together (such as precedences). In any other case this
should only speed up the search without omitting any neighbors.