com.google.ortools.constraintsolver.ConstraintSolverParametersOrBuilder Maven / Gradle / Ivy
The newest version!
// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: ortools/constraint_solver/solver_parameters.proto
package com.google.ortools.constraintsolver;
public interface ConstraintSolverParametersOrBuilder extends
// @@protoc_insertion_point(interface_extends:operations_research.ConstraintSolverParameters)
com.google.protobuf.MessageOrBuilder {
/**
*
* 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.
*
*
* .operations_research.ConstraintSolverParameters.TrailCompression compress_trail = 1;
* @return The enum numeric value on the wire for compressTrail.
*/
int getCompressTrailValue();
/**
*
* 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.
*
*
* .operations_research.ConstraintSolverParameters.TrailCompression compress_trail = 1;
* @return The compressTrail.
*/
com.google.ortools.constraintsolver.ConstraintSolverParameters.TrailCompression getCompressTrail();
/**
*
* This parameter indicates the default size of a block of the trail.
* Compression applies at the block level.
*
*
* int32 trail_block_size = 2;
* @return The trailBlockSize.
*/
int getTrailBlockSize();
/**
*
* When a sum/min/max operation is applied on a large array, this
* array is recursively split into blocks of size 'array_split_size'.
*
*
* int32 array_split_size = 3;
* @return The arraySplitSize.
*/
int getArraySplitSize();
/**
*
* This parameters indicates if the solver should store the names of
* the objets it manages.
*
*
* bool store_names = 4;
* @return The storeNames.
*/
boolean getStoreNames();
/**
*
* Create names for cast variables.
*
*
* bool name_cast_variables = 5;
* @return The nameCastVariables.
*/
boolean getNameCastVariables();
/**
*
* Should anonymous variables be given a name.
*
*
* bool name_all_variables = 6;
* @return The nameAllVariables.
*/
boolean getNameAllVariables();
/**
*
* Activate propagation profiling.
*
*
* bool profile_propagation = 7;
* @return The profilePropagation.
*/
boolean getProfilePropagation();
/**
*
* Export propagation profiling data to file.
*
*
* string profile_file = 8;
* @return The profileFile.
*/
java.lang.String getProfileFile();
/**
*
* Export propagation profiling data to file.
*
*
* string profile_file = 8;
* @return The bytes for profileFile.
*/
com.google.protobuf.ByteString
getProfileFileBytes();
/**
*
* Activate local search profiling.
*
*
* bool profile_local_search = 16;
* @return The profileLocalSearch.
*/
boolean getProfileLocalSearch();
/**
*
* Print local search profiling data after solving.
*
*
* bool print_local_search_profile = 17;
* @return The printLocalSearchProfile.
*/
boolean getPrintLocalSearchProfile();
/**
*
* Activate propagate tracing.
*
*
* bool trace_propagation = 9;
* @return The tracePropagation.
*/
boolean getTracePropagation();
/**
*
* Trace search.
*
*
* bool trace_search = 10;
* @return The traceSearch.
*/
boolean getTraceSearch();
/**
*
* Print the model before solving.
*
*
* bool print_model = 11;
* @return The printModel.
*/
boolean getPrintModel();
/**
*
* Print model statistics before solving.
*
*
* bool print_model_stats = 12;
* @return The printModelStats.
*/
boolean getPrintModelStats();
/**
*
* Print added constraints.
*
*
* bool print_added_constraints = 13;
* @return The printAddedConstraints.
*/
boolean getPrintAddedConstraints();
/**
* bool disable_solve = 15;
* @return The disableSolve.
*/
boolean getDisableSolve();
/**
*
* Control the implementation of the table constraint.
*
*
* bool use_small_table = 101;
* @return The useSmallTable.
*/
boolean getUseSmallTable();
/**
*
* Control the propagation of the cumulative constraint.
*
*
* bool use_cumulative_edge_finder = 105;
* @return The useCumulativeEdgeFinder.
*/
boolean getUseCumulativeEdgeFinder();
/**
* bool use_cumulative_time_table = 106;
* @return The useCumulativeTimeTable.
*/
boolean getUseCumulativeTimeTable();
/**
* bool use_cumulative_time_table_sync = 112;
* @return The useCumulativeTimeTableSync.
*/
boolean getUseCumulativeTimeTableSync();
/**
* bool use_sequence_high_demand_tasks = 107;
* @return The useSequenceHighDemandTasks.
*/
boolean getUseSequenceHighDemandTasks();
/**
* bool use_all_possible_disjunctions = 108;
* @return The useAllPossibleDisjunctions.
*/
boolean getUseAllPossibleDisjunctions();
/**
* int32 max_edge_finder_size = 109;
* @return The maxEdgeFinderSize.
*/
int getMaxEdgeFinderSize();
/**
*
* Control the propagation of the diffn constraint.
*
*
* bool diffn_use_cumulative = 110;
* @return The diffnUseCumulative.
*/
boolean getDiffnUseCumulative();
/**
*
* Control the implementation of the element constraint.
*
*
* bool use_element_rmq = 111;
* @return The useElementRmq.
*/
boolean getUseElementRmq();
/**
*
* 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.
*
*
* bool skip_locally_optimal_paths = 113;
* @return The skipLocallyOptimalPaths.
*/
boolean getSkipLocallyOptimalPaths();
/**
*
* Control the behavior of local search.
*
*
* int32 check_solution_period = 114;
* @return The checkSolutionPeriod.
*/
int getCheckSolutionPeriod();
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy