[ library(branch_and_bound) | The ECLiPSe Libraries | Reference Manual | Alphabetic Index ]
minimize(+Goal, ?Cost, +Module)
Find a minimal solution using the branch-and-bound method
Description
See bb_min/3 for details.
See Also
bb_min / 3, minimize / 2