12. Modeling tricks

Overview:

Prerequisites:

Classes under scrutiny:

Files:

You can find the code in the directory documentation/tutorials/cplusplus/chap13.

The files inside this directory are:

Content:

• 12.1. Different types of variables
  • 12.1.1. What if my domain is finite but non-contiguous?
  • 12.1.2. What if my domain is non-finite?
• 12.2. Efficiency
  • 12.2.1. Keep variables ordered
  • 12.2.2. Know the order of constraint propagation
• 12.3. False friends and counter-intuitive ideas
  • 12.3.1. Accepted solutions vs feasible solutions
  • 12.3.2. Composite objects
  • 12.3.3. Solve() vs SolveAndCommit()
  • 12.3.4. LocalOptimumReached() vs LocalOptimum()
  • 12.3.5. DebugString() doesn’t give the value of a solution
  • 12.3.6. Solve() vs the StartSearch() - NextSolution() - EndSearch() mechanism
• 12.4. What are my solving options?
  • 12.4.1. The search mechanism
  • 12.4.2. Global methods
  • 12.4.3. DecisionBuilders
  • 12.4.4. Decisions
  • 12.4.5. Summary
• 12.5. Customized search primitives
  • 12.5.1. What search primitives to customize?
  • 12.5.2. How to pass a common structure between different search primitives?
• 12.6. Local Search
  • 12.6.1. Let a Metaheuristic immediately kick in
• 12.7. Changing dynamically the improvement step with a SearchMonitor
• 12.8. Parallelizing with the or-tools library