General (l,S) cutting-plane

General (l,S) cutting-plane

Class: ULSAlgorithms.Exact.CuttingPlanes.GeneralLsCuttingPlaneSolver

Family: Cutting planes / convex hull
Time: O(T²) separation per root iteration + solver
Memory: O(T) separator + model/cuts
Applicability: General classical ULS

Description

General (l,S) cutting-plane is an exact polyhedral ULS strategy. It strengthens the root optimization model with classical (l,S) inequalities before the final exact solve and records the generated and added cuts.

Minimal API

IUlsSolver solver = new GeneralLsCuttingPlaneSolver();
UlsSolveResult result = solver.Solve(problem);

Scientific source

Barany, Van Roy & Wolsey (1984), Uncapacitated Lot-Sizing: The Convex Hull of Solutions

Full class reference

Use the Doxygen Classes index for constructors, members and source-level documentation.