Chapter 17 Building Hybrid Algorithms

• Combining Domains and Linear Constraints
• Reasons for Combining Solvers
• A Simple Example
  • Problem Definition
  • Program to Determine Satisfiability
  • Program Performing Optimisation
• Sending Constraints to Multiple Solvers
  • Syntax and Motivation
  • Handling Booleans with Linear Constraints
  • Handling Disjunctions
  • A More Realistic Example
• Using Values Returned from the Linear Optimum
  • Reduced Costs
  • Probing
  • Probing for Scheduling
• Other Hybridisation Forms
• References
• Hybrid Exercise