On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q127829822, #quickstatements; #temporary_batch_1722635374576 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127829822 / rank | |||
Normal rank | |||
Latest revision as of 22:50, 2 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs |
scientific article |
Statements
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (English)
0 references
15 January 1998
0 references
polyhedral combinatorics
0 references
single-item discrete lot-sizing
0 references
convex hull of feasible solutions
0 references
Wagner-Whitin costs
0 references
