Problem
|
Finds the next solution of the problem
|
|
|
Compute a minimal conflict set for an inconsistent problem
|
|
|
Optimize an integer objective variable with local optimization.
|
|
|
Alias for cp_maximize
|
|
|
Maximizes a variable
|
|
|
Alias for cp_minimize
|
|
|
Minimizes a variable
|
|
|
Posts a constraint to the problem
|
|
|
Propagates the constraints
|
|
|
Reset parameters to their default value.
|
|
|
Resets the search process
|
|
|
Restore a solver state from the stack
|
|
|
Save a marker in the stack
|
|
|
Shave the variables of the problem
|
|
|
Pretty printing of the best solution found.
|
|
|
Pretty printing of the problem
|
|
|
Pretty printing of the last solution.
|
|
|
Retrieve the value of a reversible array element.
|
|
|
Gets the index of a variable / task / resource
|
|
|
Gets the name of a variable / task / resource
|
|
|
Returns the size of a reversible array.
|
|
|
Returns the solution value of a variable
|
|
|
Retrieve the value of a reversible number.
|
|
|
Return a path-order branching scheme
|
|
|
Sets the attributes of a reversible number or array.
|
|
|
Set last solution found as target values.
|
|
|
Set the value of an element of an array of reversibles.
|
|
|
Sets the name of a variable / task / resource
|
|
|
Set the value of a reversible number.
|
© 2001-2024 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.