Combining Linear and Finite Domain Propagation

fdplex

A simple way to achieve maximum propagation is to send all numeric constraints both to fd and to eplex [20]. This requirement is automatically supported by the fdplex library.

Probing for Scheduling

For scheduling applications where the cost is dependent on each start time, a combination of solvers can be very powerful. For example, we can use finite domain propagation to reason on resources and linear constraint solving to reason on cost [5]. The probing_for_scheduling library supports such a combination, via a similar user interface to the cumulative constraint mentioned above.