ULSAlgorithms 1.1.0-g3e5595996d
High-performance exact and heuristic algorithms for uncapacitated lot sizing
Loading...
Searching...
No Matches
Aggarwal–Park

Aggarwal–Park

Class: ULSAlgorithms.Exact.AggarwalPark.AggarwalParkSolver

Family: Monge / geometric DP
Time: O(T log T)
Memory: O(T)
Applicability: General ULS costs represented by the library

Description

Aggarwal–Park is a direct exact ULS method in the Monge / 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 AggarwalParkSolver();
UlsSolveResult result = solver.Solve(problem);

Scientific source

Aggarwal & Park (1993), Improved Algorithms for Economic Lot Size Problems, Operations Research 41(3), 549-571

Full class reference

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