On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-6377(96)00043-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2107647148 / rank | |||
Normal rank | |||
Revision as of 08:30, 30 July 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
