A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
From MaRDI portal
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.