An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (Q943783): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Improved Algorithms for Economic Lot Size Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounded Production and Inventory Models with Piecewise Concave Costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic Version of the Economic Lot Size Model / rank | |||
Normal rank | |||
Latest revision as of 16:46, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs |
scientific article |
Statements
An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (English)
0 references
10 September 2008
0 references
lot sizing
0 references
dynamic programming
0 references
extreme points
0 references
0 references
0 references
