ULSAlgorithms 1.1.0-g3e5595996d
High-performance exact and heuristic algorithms for uncapacitated lot sizing
Loading...
Searching...
No Matches
Wagner–Whitin (l,S) cutting-plane

Wagner–Whitin (l,S) cutting-plane

Class: ULSAlgorithms.Exact.CuttingPlanes.WagnerWhitinLsCuttingPlaneSolver

Family: Cutting planes / Wagner–Whitin
Time: O(T²) separation per root iteration + solver
Memory: O(T) separator + model/cuts
Applicability: No speculative motive / Wagner–Whitin costs

Description

Wagner–Whitin (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 WagnerWhitinLsCuttingPlaneSolver();
UlsSolveResult result = solver.Solve(problem);

Scientific source

Pochet & Wolsey (1994), Polyhedra for Lot-Sizing with Wagner-Whitin Costs

Full class reference

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