Constants
|
Set of all the constraints
|
|
|
Set the solution algorithm for the relaxation to barrier
|
|
|
Bilevel node relaxation solver configuration
|
|
|
Xpress Kalis copyright information
|
|
|
Discrete resource
|
|
|
Input order disjunction selection heuristic
|
|
|
Input order disjunction selection heuristic
|
|
|
Disjunctions propagation type for unary resource constraints
|
|
|
Set of the distance constraints
|
|
|
Set the solution algorithm for the relaxation to dual simplex
|
|
|
Tasks Interval + Edge finding propagation type for discrete resource constraints
|
|
|
Forward checking propagation type for the all_different constraint
|
|
|
Generalized arc consistency propagation type for the all_different constraint
|
|
|
Schedule search strategy choice: heuristic solution
|
|
|
Input Order variable selection heuristic
|
|
|
Largest Earliest Completion time task selection heuristic
|
|
|
Largest Earliest Start time task selection heuristic
|
|
|
Largest Latest Completion time task selection heuristic
|
|
|
Largest Latest Start time task selection heuristic
|
|
|
Largest maximum variable selection heuristic
|
|
|
Largest minimum variable selection heuristic
|
|
|
Set of linear constraints
|
|
|
Set of logical constraints
|
|
|
Maximum constraint graph degree variable selection heuristic
|
|
|
Propagation level for maximum and minimum constraints
|
|
|
Maximum to minimum value selection heuristic
|
|
|
Maximize objective in linear relaxation
|
|
|
Maximum regret on the lower bound variable selection heuristic
|
|
|
Maximum regret on the upper bound variable selection heuristic
|
|
|
Middle value selection heuristic
|
|
|
Minimum to maximum value selection heuristic
|
|
|
Minimize objective in linear relaxation
|
|
|
Number of solutions already found for the problem
|
|
|
Nearest to target value selection heuristic
|
|
|
Set the solution algorithm for the relaxation to network simplex
|
|
|
Set of non linear constraints
|
|
|
Schedule search strategy choice: improving bound and prove optimality
|
|
|
Set the solution algorithm for the relaxation to primal simplex
|
|
|
Seed of the random generator
|
|
|
Random value selection heuristic
|
|
|
Random variable selection heuristic
|
|
|
Set the solution algorithm for the relaxation
|
|
|
Set MIP search flag for the linear relaxation
|
|
|
Set the MIP absolute tolerance to optimality for the resolution of the linear relaxation solver
|
|
|
Set the MIP relative tolerance to optimality for the resolution of the linear relaxation solver
|
|
|
Set the optimality tolerance for the resolution of the linear relaxation solver
|
|
|
Use presolve for relaxation
|
|
|
Use reduced costs for propagation
|
|
|
Use reload basis for relaxation
|
|
|
Group parameter choice for strategy optimisation
|
|
|
Group parameter choice for all parameters
|
|
|
Group parameter choice for strategy properties
|
|
|
Group parameter choice for variable bounds
|
|
|
Group parameter choice for variable precisions
|
|
|
Smallest domain size to degree ratio variable selection heuristic.
|
|
|
Type of limitation on the search tree
|
|
|
Type of limitation on the search tree
|
|
|
Type of limitation on the search tree
|
|
|
Type of limitation on the search tree
|
|
|
Type of limitation on the search tree
|
|
|
Type of limitation on the search tree
|
|
|
Smallest domain variable selection heuristic (finite domain and continuous variables)
|
|
|
Smallest Earliest Completion time task selection heuristic
|
|
|
Smallest Earliest Start time task selection heuristic
|
|
|
Smallest Latest Completion time task selection heuristic
|
|
|
Smallest Latest Start time task selection heuristic
|
|
|
Smallest maximum variable selection heuristic
|
|
|
Smallest minimum variable selection heuristic
|
|
|
Use LP relaxation
|
|
|
Use MIP relaxation
|
|
|
Input order task selection heuristic
|
|
|
Task intervals propagation type for resource constraints
|
|
|
Random order task selection heuristic
|
|
|
Control if task variables are using bound domains or dense domains
|
|
|
Timetabling propagation type for resource constraints
|
|
|
Limitation on the optimization through absolute tolerance
|
|
|
Limitation on the optimization through relative tolerance
|
|
|
No limitation on the optimization due to tolerance limits
|
|
|
Top node relaxation solver configuration
|
|
|
Tree node relaxation solver configuration
|
|
|
Unary resource
|
|
|
Widest domain variable selection heuristic (continuous variables)
|
© 2001-2025 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.