ULSAlgorithms 1.1.0-g3e5595996d
High-performance exact and heuristic algorithms for uncapacitated lot sizing
Loading...
Searching...
No Matches
Wagelmans general

Wagelmans general

Class: ULSAlgorithms.Exact.Wagelmans.WagelmansGeneralSolver

Family: Geometric DP
Time: O(T log T)
Memory: O(T)
Applicability: General time-varying ULS costs

Description

Wagelmans general is a direct exact ULS method in the Geometric DP family. It solves the problem without requiring an external mathematical-programming engine and returns an optimal solution when its applicability conditions are satisfied.

Minimal API

IUlsSolver solver = new WagelmansGeneralSolver();
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

Full class reference

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