SolutionStrategySingleTree
Lazy constraint callback strategy (single-tree)
Lazy constraint callback strategy (single-tree)
Callback-based outer approximation within single B&B tree.
Algorithm Pattern:
- Solve MIP with lazy constraint callback
- Callback checks integer solutions for feasibility
- Generate hyperplanes for violated constraints
- Add as lazy constraints, solver continues
Task Flow (initializeStrategy):
- CreateDualProblem → ConfigureCallback → SolveProblem
- (cuts added via callback during solve)
Advantages:
- Single B&B tree exploration
- Potentially fewer node evaluations
- Better integration with MIP solver
Disadvantages:
- Requires solver callback support
- Limited to CPLEX/Gurobi
- More complex debugging
Algorithm
Branch-and-cut with lazy ESH constraints
See Also
- MIPSolverCplexSingleTree, MIPSolverGurobiSingleTree
Source
Header file: `src/SolutionStrategy/SolutionStrategySingleTree.h`