Adaptive exact selection

Adaptive exact selection

Class: ULSAlgorithms.Selection.AdaptiveExactUlsSolver

Family: Adaptive exact strategy selection
Time: O(T) in the NSM case; O(T log T) in the general case
Memory: O(T)
Applicability: All validated classical ULS instances; dispatches from the no-speculative-motive condition

Description

Adaptive exact selection is the recommended orchestration strategy when client code needs an exact ULS solution without hard-coding a particular exact algorithm. It inspects the no-speculative-motive cost condition and dispatches to the fastest supported specialized or general exact strategy.

Minimal API

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

Scientific source

Wagelmans, Van Hoesel & Kolen (1992), Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case, Operations Research 40(S1), S145-S156; Federgruen & Tzur (1991), A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in O(n log n) or O(n) Time, Management Science 37(8), 909-925

Full class reference

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