Next: REPAIR: Constraint-Based Repair
Up: FDPLEX: A Hybrid Finite
Previous: Functionality
  Index
Subsections
minimize(+Goal, +Expr) and min_max(+Goal, +Expr)
These are variants of the minimize/2 and min_max/2 predicates
from the fd-library.
They differ in that they set up a cooperating simplex solver
prior to entering the branch-and-bound search.
indomain(+Var)
A variant of indomain/1 with modified value order: The integer
that is closest to the relaxed-problem solution is chosen first.
A labeling routine using the modified indomain/1.
split_domain(+Var)
An alternative labeling primitive. It splits the variable's domain at the value
suggested by the relaxed solution.
A labeling routine using split_domain/1
instead of indomain/1.
Extract a relaxed LP-problem from the finite-domain constraints
(this is done implicitly in minimize and min_max).
A list of =, >= and =< constraints is returned, and the variables involved
are given the correct bounds and integer-type.
Same as above, but the result is in normalised form, acceptable to lp_setup/4.
Returns a list of counters giving information about the most recent
invocation of minimize/min_max.
Backtracks is the number of times
indomain/1.
has generated an alternative value.
SolverCalls is the number of times the simplex solver was invoked.
SolverFails counts how often the simplex detected infeasibility
and SolverBound is the number of simplex solutions that were able
to increase the lower cost bound. The difference
SolverCalls-(SolverFails+SolverBound) represents the number of 'useless' simplex
invocations, in the sense that these invocations didn't affect the search space.
However, they might still have improved the labeling heuristics.
Next: REPAIR: Constraint-Based Repair
Up: FDPLEX: A Hybrid Finite
Previous: Functionality
  Index
1999-08-06