BranchAndBoundSolverOptions
Options & Configuration · AiDotNet.Models.Options
Configuration for the branch-and-bound integer-programming solver.
Inheritance: ModelOptions → BranchAndBoundSolverOptions
For Beginners
The solver divides a whole-number problem into smaller branches, discarding any branch that cannot beat the best answer already found.
How It Works
Reference: Land and Doig, “An Automatic Method of Solving Discrete Programming Problems” (1960).
Constructors
| Constructor | Summary |
|---|---|
BranchAndBoundSolverOptions() |
Creates options with the default values. |
BranchAndBoundSolverOptions(BranchAndBoundSolverOptions other) |
Creates a copy of another options instance. |
Properties
| Property | Summary |
|---|---|
SimplexSolverOptions RelaxationOptions { get; set; } |
Gets or sets the options used for each linear-programming relaxation solved at a node. |
double IntegralityTolerance { get; set; } |
Gets or sets how far from a whole number a value may sit and still count as integral. |
double MinimumImprovement { get; set; } |
Gets or sets the improvement a candidate must show over the incumbent before it replaces it. |
int MaxNodes { get; set; } |
Gets or sets the maximum number of search-tree nodes explored. |