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

Zangwill network

Class: ULSAlgorithms.Exact.Zangwill.ZangwillNetworkSolver

Family: Network / shortest path
Time: O(T²)
Memory: O(T)
Applicability: Single-echelon no-backlogging ULS represented by the library

Description

Zangwill network is a direct exact ULS method in the Network / shortest path 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 ZangwillNetworkSolver();
UlsSolveResult result = solver.Solve(problem);

Scientific source

Zangwill (1969), A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System, Management Science 15(9), 506-527

Full class reference

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