Mixed-Integer Programming

• Modeling
  • The Environment
  • Models
  • Variables
  • Expressions
  • Constraints
  • Objective Functions
• Optimizers
  • Solving a Model and Accessing the Solution
  • Getting Access to The Underlying Optimizer
  • Adding User Cuts and Lazy Constraints
  • Creating Your Own Universal Callback
  • Creating Your Own Optimizer (Advanced) [TODO]
• Branch-and-Bound Algorithm
  • Writing an LP-based Branch-and-Bound [TODO]
  • Adding User Cuts and Lazy Constraints [TODO]
  • Create Your Own Callback (Advanced) [TODO]
  • Creating Your Own Node Class (Advanced) [TODO]
  • Creating Your Own Branching Rule (Advanced) [TODO]
  • Creating Your Own Node Selection Rule (Advanced) [TODO]
• Column Generation and Branch-and-Price Algorithm
  • Modeling and Solving A Dantzig-Wolfe Reformulation [TODO]
  • Using In-Out Stabilization [TODO]
  • Writing A Branch-and-Price Algorithm [TODO]
  • The Integer Master Heuristic [TODO]
  • Using Strong Branching
  • Writing A Branch-and-Cut-and-Price Algorithm [TODO]