Yet Another Note on An Efficient Zero-One Formulation of theMultilevel Lot-Sizing Problem

In An Efficient Zero-One Formulation of the Multilevel Lot-Sizing Problem MCKNEW,SAY-DAM,and COLEMAN claim the polynomial solvability of this particular production planning problem. Both, the proof given by MCKNEW et al. and a statement of its incorrectness by RAJAGOPALAN contain errors, and the question remains whether the approach leads to a polyomial time algorithm. We show by means of an example that solving the linear program is not sufficient.

MoreLess

Year of publication:	1998
Authors:	Bussieck, Michael R. ; Fink, Andreas ; Lübbecke, Marco E.
Institutions:	Institut für Wirtschaftsinformatik <Hamburg>
Subject:	Wirtschaftsinformatik \| business informatics

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	26624 bytes 3 p. application/pdf
Series:	Universität Hamburg - Institut für Wirtschaftsinformatik - Publikationen
Type of publication:	Book / Working Paper
Language:	English
Classification:	Lot sizing and Scheduling ; Business data processing. General ; Individual Working Papers, Preprints ; No country specification
Source:	USB Cologne (business full texts)

Persistent link: https://www.econbiz.de/10005840953