ULSAlgorithms 1.1.0-g3e5595996d
High-performance exact and heuristic algorithms for uncapacitated lot sizing
Loading...
Searching...
No Matches
Karni Maximum Part-Period Gain

Karni Maximum Part-Period Gain

Class: ULSAlgorithms.Heuristics.KarniMaximumPartPeriodGainSolver

Family: Global part-period merge
Time: O(T log T)
Memory: O(T)
Applicability: Stationary setup, production and relevant holding costs

Description

Karni Maximum Part-Period Gain is a fast ULS heuristic in the Global part-period merge family. It constructs a feasible replenishment plan without claiming an optimality proof. Use it only when the documented applicability conditions match the instance.

Minimal API

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

Scientific source

Karni (1981), Maximum Part-Period Gain lot-sizing rule; Baciarello et al. (2013), Lot Sizing Heuristics Performance

Full class reference

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