Problem
| cp_find_next_sol |
Finds the next solution of the problem
|
| cp_infeas_analysis |
Compute a minimal conflict set for an inconsistent problem
|
| cp_local_optimize |
Optimize an integer objective variable with local optimization.
|
| cp_maximise |
Alias for cp_maximize
|
| cp_maximize |
Maximizes a variable
|
| cp_minimise |
Alias for cp_minimize
|
| cp_minimize |
Minimizes a variable
|
| cp_post |
Posts a constraint to the problem
|
| cp_propagate |
Propagates the constraints
|
| cp_reset_params |
Reset parameters to their default value.
|
| cp_reset_search |
Resets the search process
|
| cp_restore_state |
Restore a solver state from the stack
|
| cp_save_state |
Save a marker in the stack
|
| cp_shave |
Shave the variables of the problem
|
| cp_show_best_sol |
Pretty printing of the best solution found.
|
| cp_show_prob |
Pretty printing of the problem
|
| cp_show_sol |
Pretty printing of the last solution.
|
| getelt |
Retrieve the value of a reversible array element.
|
| getname |
Gets the name of a variable / task / resource
|
| getsize |
Returns the size of a reversible array.
|
| getsol |
Returns the solution value of a variable
|
| getval |
Retrieve the value of a reversible number.
|
| path_order |
Return a path-order branching scheme
|
| set_reversible_attributes |
Sets the attributes of a reversible number or array.
|
| set_sol_as_target |
Set last solution found as target values.
|
| setelt |
Set the value of an element of an array of reversibles.
|
| setname |
Sets the name of a variable / task / resource
|
| setval |
Set the value of a reversible number.
|