[ The ECLiPSe Libraries | Reference Manual | Alphabetic Index ]

library(branch_and_bound)

Generic branch-and-bound primitives

Predicates

bb_cost(++Handle, -Cost)
Low-level primitive for building branch-and-bound-style search procedures
bb_finish(++Handle)
Low-level primitive for building branch-and-bound-style search procedures
bb_init(++ExtremeCost, -Handle)
Low-level primitive for building branch-and-bound-style search procedures
bb_min(+Goal, ?Cost, ?Options)
Find a minimal solution using the branch-and-bound method
bb_min(+Goal, ?Cost, ?Options, +Module)
Find a minimal solution using the branch-and-bound method
bb_min(+Goal, ?Cost, ?Template, ?Solution, ?Optimum, ?Options)
Find a minimal solution using the branch-and-bound method
bb_min(+Goal, ?Cost, +Template, ?Solution, ?Optimum, ?Options, +Module)
Find a minimal solution using the branch-and-bound method
bb_probe(++From, ++To, +Goal, ?Template, ?Cost, ++Handle, ++Module)
Low-level primitive for building branch-and-bound-style search procedures
bb_solution(++Handle, -Solution)
Low-level primitive for building branch-and-bound-style search procedures
minimize(+Goal, ?Cost)
Find a minimal solution using the branch-and-bound method

Structures

struct bb_options(strategy, from, to, delta, factor, timeout, probe_timeout, report_success, report_failure)
No description available

Description

This is a solver-independent library implementing branch-and-bound primitives. It can be used with any nondeterministic search routine that instantiates a cost variable when a solution is found. The cost variable can be an arbitrary numerical domain variable or even a simple domain-less variable.

The main predicates are bb_min/3, bb_min/6 and, as a shorthand, minimize/2.

About

Generated from branch_and_bound.eci on Sat Aug 7 01:44:22 2004